Search Results - (( global optimization path algorithm ) OR ( _ evaluation between algorithm ))

Refine Results
  1. 1

    Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin by Sariff, Nohaidda, Buniyamin, Norlida

    Published 2010
    “…This paper presents the application of Genetic Algorithm and Ant Colony Optimization (ACO) Algorithm for robot path planning (RPP) in global static environment. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The objective is to verify and compare the effectiveness of both algorithms in finding the optimal robot path in different types of global map environments. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

    Published 2024
    “…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    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
  5. 5
  6. 6
  7. 7

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

    Published 2023
    “…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
  8. 8

    Development of an improved Jellyfish Search (JS) algorithm for solving the optimal path problem of multi-robot collaborative multi-tasking in complex vertical farms by Shen, Jiazheng, Tang, Saihong, Zhao, Ruixin, Fan, Luxin, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan

    Published 2025
    “…Comparative experiments demonstrate that TLDW-JS outperforms classic optimization algorithms such as the Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Dung Beetle Optimization (DBO), achieving superior path length optimization, reduced energy consumption, and improved convergence speed. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Development of an improved GWO algorithm for solving optimal paths in complex vertical farms with multi-robot multi-tasking by Shen, Jiazheng, Hong, Tang Sai, Fan, Luxin, Zhao, Ruixin, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan

    Published 2024
    “…The EPDE-GWO algorithm is compared with Genetic Algorithm (GA), Simulated Annealing (SA), Dung Beetle Optimizer (DBO), and Particle Swarm Optimization (PSO). …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17

    A Hybrid Metaheuristic Technique Based on Grey Wolf Optimisation, Symbiotic Organism Search, and Ant Colony Optimisation for Solving Multi-Objective Vehicle Routing Problems by Ary, Maxsi

    Published 2025
    “…For objective two, three routing strategies were evaluated. Based on a single-vehicle optimal route, the algorithm provided the shortest distance, 91.74 km. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Adaptive route optimization for mobile robot navigation using evolutionary algorithm by Kit Guan Lim, Guan Lim, Yoong Hean Lee, Hean Lee, Min Keng Tan, Keng Tan, Hou, Pin Yoong, Tienlei, Wang, Tze, Kenneth Kin Teo

    Published 2021
    “…For example, Ant Colony Optimization (ACO) is an optimization algorithm based on swarm intelligence which is widely used to solve path planning problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  19. 19

    A review on autonomous mobile robot path planning algorithms by Noraziah, Adzhar, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2020
    “…This yield to a lot of improvement and suggestions in many areas related to mobile robot such as path planning. The purpose of this paper is to review the mobile robots path planning problem, optimization criteria and various methodologies reported in the literature for global and local mobile robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    The performance effect due to varying network topologies on a software-defined network employing the k-shortest path by Linsheng, R., Derahman, M. N., Kadir, M. F. A., Mohamed, M. A., Kamarudin, S.

    Published 2022
    “…K-shortest paths algorithm discovers a set of paths ordered in the most optimal, optimal, and suboptimal, has a very wide application is integrated into SDN controller to handle routing functionality. …”
    Get full text
    Get full text
    Article