Search Results - (( developing program ant algorithm ) OR ( java implementation path algorithm ))

Refine Results
  1. 1

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…This research starts with developing an algorithm based on original concept of Ant System Algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

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

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

    Published 2012
    “…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 other ant based algorithm, in terms of resource utilization. …”
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4

    Simulation and Visualization of TSP Using Ant Colony Optimization by Tri Basuki, Kurniawan, Misinem, ., Astried, ., Joan Angelina, Widians

    Published 2023
    “…With Windows as the operating system and the C# programming language in Visual Studio 2019, the program complies with the Extreme Programming (XP) software development method. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Optimization of milling parameters using ant colony optimization by Mohd Saupi, Mohd Sauki

    Published 2008
    “…The result obtained from this simulation will compare with another method like Genetic Algorithm (GA) and Linear Programming Technique (LPT) to validation. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  6. 6

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

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

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

    Published 2011
    “…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
  11. 11

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

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion 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 other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  13. 13
  14. 14
  15. 15
  16. 16

    Some metaheuristic algorithms for solving multiple cross-functional team selection problems by Ngo, S.T., Jaafar, J., Izzatdin, A.A., Tong, G.T., Bui, A.N.

    Published 2022
    “…We compared the developed algorithms with the MIQP-CPLEX solver on 500 programming contestants with 37 skills and several randomized distribution datasets. …”
    Get full text
    Get full text
    Article
  17. 17

    A Community-Based Fault Isolation Approach for Effective Simultaneous Localization of Faults by Zakari, Abubakar, Lee, Sai Peck, Targio Hashem, Ibrahim Abaker

    Published 2019
    “…The approach is evaluated on eight subject programs ranging from medium-sized to large-sized programs (tcas, replace, gzip, sed, flex, grep, make, and ant). …”
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    Some Metaheuristics for Tourist Trip Design Problem by Son, N.T., Nguyet Ha, T.T., Jaafar, J.B., Anh, B.N., Giang, T.T.

    Published 2023
    “…We have built two metaheuristic algorithms based on the proposed approach, which are Genetic Algorithm (GA) and another is Ant Colony Optimization (ACO). …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Scheduling dynamic cellular manufacturing systems in the presence of cost uncertainty using heuristic method by Delgoshaei, Aidin

    Published 2016
    “…Since the proposed models (like similar models in the literature) are likely to fall into local optimum points, a Branch and Bound based heuristic, a hybrid Simulated Annealing and Genetic algorithm, a hybrid Tabu search and Simulated Annealing, a hybrid Genetic algorithm and Simulated Annealing, a hybrid Ant Colony Optimization and Simulated Annealing and a hybrid Multi-layer Perceptron and Simulated Annealing algorithms are developed. …”
    Get full text
    Get full text
    Thesis