Search Results - (( parameter simulation modified algorithm ) OR ( changes optimization path algorithm ))

Refine Results
  1. 1

    Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network by Al-Kharasani, Nori Mohammed Abdulkarem

    Published 2020
    “…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Search algorithms for path planning problems in harsh wireless sensor network environment by Hong, Siaw Swin

    Published 2017
    “…The three addressed problems are 1) long initial computation delay in dynamic environment, 2) slow reaction towards rapid change of goal points and massive number of node depending on single source of computational power, and 3) tradeoffs between optimality and computational effort to achieve optimality in TSP path planning problem. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Application of the Bees Algorithm to find optimal drill path sequence by Zainal Abidin, Muhammad Harith, Kamaruddin, Shafie, Adam Malek, Afiqah, Sukindar, Nor Aiman

    Published 2024
    “…The main finding of the study is that the Bees Algorithm found optimal drill path length and minimum machining time comparable to the results of the other algorithms for the 5 × 5, 7 × 7 and 9 × 9 problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  5. 5

    Autonomous mobile robots path planning with integrative edge cloud-based ant colony optimization by Nor Azmi, Siti Nur Lyana Karmila, Anwar Apandi, Nur Ilyana, Rafique, Majid, Muhammad, Nor Aishah

    Published 2025
    “…However, traditional Ant Colony Optimization (ACO) algorithms, widely used for AMR path planning, exhibit limitations such as low convergence rates and redundant recalculations, particularly in environments with frequently changing obstacles. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  7. 7

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

    Published 2024
    “…Particle swarm optimization (PSO) outperforms conventional methods like artificial potential fields (APF), the Dijkstra algorithm, and the A* algorithm in path planning for mobile robots. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  8. 8

    Hybrid meta-heuristic algorithm for solving multi-objective aggregate production planning in fuzzy environment by Kalaf, Kalaf, Bayda Atiya

    Published 2017
    “…During the course of the present work, two fuzzy methods (modified Zimmermanns approach and modified angelovs approach ) and fourmeta-heuristics and hybrid meta heuristics including; simulated annealing (SA), modified simulated annealing (MSA), hybrid modified simulated annealing and simplex downhill (MSASD), hybrid modified simulated annealing and modified particle swarm optimization (MSAPSO) were proposed. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Dynamic obstacle handling in multi-robot coverage by Tay, Wing Le

    Published 2024
    “…The impacts of the modified algorithm’s parameters on simulation results were also studied to determine the optimal parameters for achieving better performance. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19

    Numerical simulations of agent navigation via half-sweep modified two-parameter over-relaxation (HSMTOR) by F A Musli, Jumat Sulaiman, Azali Saudi

    Published 2021
    “…A new method called Half-Sweep Modified Two-Parameter Over-Relaxation (HSMTOR) is used to solve the navigational problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  20. 20

    Hybrid Optimization with Enhanced QoS-based Path Selection in VANETs by F. Al-dolaimy, F. Al-dolaimy, Rabei Raad Ali, Rabei Raad Ali, Noor Nabeel, Noor Nabeel

    Published 2023
    “…The EWOA algorithm is used for initial optimal path selection, and ACO is used to find the best optimal solution to achieve effective communication in VANETs. …”
    Get full text
    Get full text
    Get full text
    Article