Search Results - (( java simulation optimization algorithm ) OR ( using time path algorithm ))

Refine Results
  1. 1

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  2. 2

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Energy efficient path reconstruction in wireless sensor network using iPath by Hasan, Sazlinah, Abd, Wamidh Jwdat, Ariffin, Ahmad Alauddin

    Published 2019
    “…This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

    Published 2015
    “…There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

    Published 2017
    “…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7
  8. 8

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  11. 11

    Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

    Published 2006
    “…In relation to that, A* algorithm was used as a path finding technique to plan a collision-free-path journey from one location to another. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    An experiment on the performance of shortest path algorithm by Chan, Simon Yew Meng, Adnan, Nur’ayuni, Sukri, Syazwan Syafiqah, Wan Zainon, Wan Mohd Nazmee

    Published 2016
    “…Shortest path algorithms are one of the main algorithms used in most navigation system. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin

    Published 2022
    “…One way to improve the multi-hole drilling is by optimising the tool path in the process. This research aims to model and optimise multi-hole drilling problems using Particle Swarm Optimisation (PSO) algorithm. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin, M. F. F., Ab Rashid, N. M. Zuki, N. M.

    Published 2018
    “…PSO algorithm gives the minimum value of fitness path and their CPU time compared to other algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
  16. 16

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
    Get full text
    Thesis
  17. 17

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
  18. 18

    Modeling and optimization of multi-holes drilling path using Particle Swarm Optimization by Ab Rashid, Mohd Fadzil Faisae, Nik Mohamed, Nik Mohd Zuki, Romlay, Fadhlur Rahman Mohd, Razali, Akhtar Razul, Asmizam, Mokhtar

    Published 2018
    “…Various researches had been conducted to reduce the tool movement and switching time. This research aim to reduce the machining time by minimizing the tool path using metaheuristics algorithms. …”
    Get full text
    Get full text
    Research Report
  19. 19

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

    Published 2023
    “…It was found that the number of populations set to 75 and dynamically adjusts the value of inertial weight, the cognitive and social parameter provides the best performance in terms of shortest path length and execution time. In conclusion, this project shows that the MPSO algorithm is capable of generating a better path compared to the normal PSO algorithm in terms of average path length and execution time, making it a promising algorithm for multi-robot path planning in dynamic environments.…”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  20. 20