Search Results - (( java implementation path algorithm ) OR ( based computing colony algorithm ))

Refine Results
  1. 1

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    Published 2012
    “…This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. …”
    Get full text
    Get full text
    Get full text
    Monograph
  3. 3

    Optimizing large scale combinatorial problems using multiple ant colonies algorithm based on pheromone evaluation technique by Aljanaby, Alaa, Ku-Mahamud, Ku Ruhana, Md Norwawi, Norita

    Published 2008
    “…The new algorithm is based on the ant colony system and utilizes average and maximum pheromone evaluation mechanisms. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Ant colony optimization algorithm for rule based classification: Issues and potential by Al-Behadili, Hayder Naser Khraibet, Ku-Mahamud, Ku Ruhana, Sagban, Rafid

    Published 2018
    “…Nevertheless, ACO also has several drawbacks that may reduce the classification accuracy and the computational time of the algorithm. This paper presents a review of related work of ACO rule classification which emphasizes the types of ACO algorithms and issues. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

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

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Global gbest guided-artificial bee colony algorithm for numerical function optimization by Shah, Habib, Tairan, Nasser, Garg, Harish, Ghazali, Rozaida

    Published 2018
    “…Recently, an attractive bio-inspired method—namely the Artificial Bee Colony (ABC)—has shown outstanding performance with some typical computational algorithms in different complex problems. …”
    Get full text
    Get full text
    Article
  8. 8

    Hybrid ant colony system and genetic algorithm approach for scheduling of jobs in computational grid by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

    Published 2015
    “…This study proposes a high level hybrid approach between ant colony system and genetic algorithm for job scheduling in grid computing.The proposed approach is based on a high level hybridization.The proposed hybrid approach is evaluated using the static benchmark problems known as ETC matrix.Experimental results show that the proposed hybridization between the two algorithms outperforms the stand-alone algorithms in terms of best and average makespan values.…”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    An enhanced ant colony system algorithm for dynamic fault tolerance in grid computing by Saufi, Bukhari

    Published 2020
    “…The proposed algorithm consists of dynamic evaporation rate, resource fitness-based scheduling process, enhanced pheromone update with trust factor and suspension, and checkpoint-based task reprocessing. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Hybrid ant colony system algorithm for static and dynamic job scheduling in grid computing by Alobaedy, Mustafa Muwafak Theab

    Published 2015
    “…The proposed algorithms were evaluated against twelve metaheuristic algorithms in static (expected time to compute model) and dynamic (distribution pattern) grid computing environments. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12
  13. 13
  14. 14

    Enhanced ant colony optimization for grid load balancing by Mohamed Din, Aniza, Ku-Mahamud, Ku Ruhana, Abdul Nasir, Husna Jamal

    Published 2011
    “…This paper proposes an Enhanced Ant Colony Optimization (EACO) algorithm for dynamic schedulling and load balancing in a grid computer system. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Grid load balancing using enhance ant colony optimization by Ku-Mahamud, Ku Ruhana, Abdul Nasir, Husna Jamal, Mohamed Din, Aniza

    Published 2011
    “…This study presents a new algorithm based on ant colony optimization for load balancing management in grid computing. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item