Search Results - (( simulation optimization function algorithm ) OR ( based application path algorithm ))

Refine Results
  1. 1

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
    Get full text
    Get full text
    Thesis
  2. 2

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
    Get full text
    Get full text
    Thesis
  3. 3

    Modelling of multi-robot system for search and rescue by Poy, Yi Ler

    Published 2023
    “…One of the key aspects in multi-robot systems is the path planning problem, which involves finding collision-free paths for each robot to reach their respective destinations while optimizing various performance metrics. This report focusses on developing a novel multi-robot path planning algorithm based on the Modified Particles Swarm Optimization (MPSO) algorithm for dynamic environments. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  4. 4

    The Hybrid of WOABAT-IFDO Optimization Algorithm and Its Application in Crowd Evacuation Simulation by Hamizan, Sharbini, Roselina, Sallehuddin, Habibollah, Haron

    Published 2023
    “…This paper proposes a new hybrid of nature inspired optimization algorithm (IFDO-WOABAT) based on the latest optimization algorithm namely Improved Fitness Dependent Optimization (IFDO) with Whale-Bat Optimization algorithm (WOABAT). …”
    Get full text
    Get full text
    Get full text
    Proceeding
  5. 5

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Optimised multi-robot path planning via smooth trajectory generation by Loke, Zhi Yu

    Published 2024
    “…The deployment of multi-robot system (MRS) in real-world applications like warehouses and manufacturing plants has increased the importance of path planning algorithms for MRS. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  7. 7

    On network flow problems with convex cost by Nguyen, V.A., Tan, Y. P.

    Published 2004
    “…To address this problem, we derive the optimality conditions for minimising convex and differentiable cost functions, and devise an algorithm based on the primal-dual algorithm commonly used in linear programming. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Reliable Fuzzy-Based Multi-Path Routing Protocol Based on Whale Optimization Algorithm to Improve QOS in 5G Networks for IOMT Applications by Al-Mukhtar F.S., Jaaz Z.A., Hamad A.H.

    Published 2024
    “…The Whale Optimization Algorithm (WOA) enhances the routing protocol performance. …”
    Article
  9. 9

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…The whole constraint analyzer and the fitness function were combined with four SBTs (genetic algorithm, evolutionary algorithm, simulating annealing, and quantum genetic algorithm). …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2011
    “…Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
    Get full text
    Get full text
    Get full text
    Monograph
  12. 12

    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

    Published 2016
    “…Results: The analysis of computational results showed that the modified RTS algorithm provided a better solution quality in terms of minimizing the objective function of TSPs, while the SA algorithm was useful for obtaining instant solutions for TSPs with a large number of cities. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…It is based on Ant Colony Optimization (ACO) meta heuristic, which is adopted to enhance the paths with the best-quality function. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Adaptive model predictive control based on wavelet network and online sequential extreme learning machine for nonlinear systems by Salih, Dhiadeen Mohammed

    Published 2015
    “…The AUR is established based on Lyapunov stability theorem to find the limits of the optimization step size that guarantee a stable path on the objective function trajectory. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller by Zaridah, Mat Zain

    Published 2010
    “…The contribution of this work is to optimize the base of Fuzzy membership function of the APFLC by using GA technique. …”
    Get full text
    Thesis
  16. 16
  17. 17

    Detection of black hole nodes in mobile ad hoc network using hybrid trustworthiness and energy consumption techniques by Mustafa, Ahmed Sudad

    Published 2017
    “…An empirical testing approach was utilized here where several scenarios have been implemented and investigated in order to find the optimal settings. Network simulator (NS2) simulation findings demonstrate that the trust based algorithm achieves an average packet delivery ratio (PDR) of 87.3%, end to end delay (EED) of 7.47 ms and black hole detection accuracy of 90%. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Reliable Path Selection Packet Forwarding Routing Protocol for Vehicular Adhoc Networks by Irshad Ahmed, Abbasi

    Published 2019
    “…The scheme is envisaged to function well for various kinds of vehicular communication applications by assuring user connectivity. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    A multiobjective simulated Kalman filter optimization algorithm by A. Azwan, A. Razak, Mohd Falfazli, Mat Jusof, Ahmad Nor Kasruddin, Nasir, Mohd Ashraf, Ahmad

    Published 2018
    “…This paper presents a new multiobjective type optimization algorithm known as a Multiobjective Optimization Simulated Kalman Filter (MOSKF). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Convergence Analysis of the African Buffalo Optimization Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar, Noraziah, Ahmad

    Published 2016
    “…The analysis of the convergence of Nature-inspired optimization algorithms is necessary to help researchers and practitioners understand the workings of the algorithms in the algorithms’ attempts at solutions. …”
    Get full text
    Get full text
    Get full text
    Article