Search Results - (( solution using ((acs algorithm) OR (path algorithm)) ) OR ( java implication based algorithm ))

Search alternatives:

Refine Results
  1. 1
    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Embedding Malaysian House Red Ant Behavior into an Ant Colony System

    Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2008
    “…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  3. 3
    Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP).

    Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP). by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

    Published 2007
    “…Their ability as a colony to find paths or routes to the food sources has inspired the development of an algorithm namely Ant Colony System (ACS). …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Strategies DACS3 Increasing its Performances

    Strategies DACS3 Increasing its Performances by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2009
    “…Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman problem (TSP). …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  5. 5
    FINDING SHORTEST PATH FOR DYNAMIC PUTTING PROBLEM USING ANT COLONY OPTIMISATION

    FINDING SHORTEST PATH FOR DYNAMIC PUTTING PROBLEM USING ANT COLONY OPTIMISATION by Nor Akmal, Abdul Aziz

    Published 2005
    “…Specifically. this thesis is intended to develop a system that can display the shortest path by the used of two algorithm in ACO which were Ant System (AS) and Ant Colony System (ACS). …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  6. 6
    DACS3:Embedding Individual Ant Behavior in Ant Colony System

    DACS3:Embedding Individual Ant Behavior in Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2008
    “…Their ability as a colony, to find paths to food sources has inspired the development of algorithms known as Ant Colony Systems (ACS). …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    DACS3: Embedding Malaysian Individual Ant Behavior in Ant Colony System

    DACS3: Embedding Malaysian Individual Ant Behavior in Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2009
    “…Their ability as a colony, to find paths to food sources has inspired the development of algorithms known as Ant Colony Systems (ACS). …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  8. 8
    A Kalman Filter Approach to PCB Drill Path Optimization Problem

    A Kalman Filter Approach to PCB Drill Path Optimization Problem by Abdul Aziz, Nor Hidayati, Zuwairie, Ibrahim, Ab. Aziz, Nor Azlina, Saifudin, Razali, Abas, Khairul Hamimah, Mohamad, Mohd Saberi

    Published 2017
    “…This paper presents a Kalman Filter approach in solving printed circuit board (PCB) routing problem by using the Simulated Kalman Filter (SKF) algorithm. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Optimal robot path planning using enhanced particle swarm optimization algorithm

    Optimal robot path planning using enhanced particle swarm optimization algorithm by Mohammed, Athraa Jasim, Ghathwan, Khalil Ibrahim, Yusof, Yuhanis

    Published 2020
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    A Mobile Web Application Engine for Generating Destination-oriented LRT Route

    A Mobile Web Application Engine for Generating Destination-oriented LRT Route by Abdullah, Muhammad Haziq Lim, Saifudin, Wan Sazli Nasaruddin, Hussin, Burairah, Abdul-Aziz, Azlianor, Sulong, Muhammad Suhaizan, Kamalrudin, Massila

    Published 2009
    “…In this paper, we proposed the used of Dijkstra’s Algorithms to provide more effective and intelligent shortest path system to provide the solution for traveler to reach the desired destination.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming

    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

    Published 2016
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A robust GA-based QoS routing algorithm for solving multi-constrained path problem

    A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

    Published 2023
    “…However, the actual link metrics in a QoS-aware network is dynamic and may continuously change over time and since the path given by the routing algorithm is computed using the state information available to the router, which may or may not be up-to-date, it is possible that a feasible path returned by the algorithm may turn out to be no longer valid. …”
    Article
    Save to List
    Saved in:
  13. 13
    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…BST has been used to store the paths that Dijkstra algorithm initialled. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Optimization of drilling path using the bees algorithm

    Optimization of drilling path using the bees algorithm by Kamaruddin, Shafie, Rosdi, Mohamad Naqiuddin, Sukindar, Nor Aiman

    Published 2021
    “…This study uses the Bees Algorithm to find the best sequence of drilling holes (minimum total path length) and the results found are compared with the result of other algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem

    Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem by NurulFarihan Mohamed, ZaitulMarlizawati Zainuddin, Said Salhi, Nurul Huda Mohamed, NurulAkmal Mohamed

    Published 2024
    Article
    Save to List
    Saved in:
  16. 16
    Finding multi-constrained path using genetic algorithm

    Finding multi-constrained path using genetic algorithm by Yussof S., See O.H.

    Published 2023
    “…This paper presents a solution to the MCP problem using genetic algorithm (GA). …”
    Conference paper
    Save to List
    Saved in:
  17. 17
    Solving Nonlinear Algebraic Problem Using Newton Homotopy Differential Equation

    Solving Nonlinear Algebraic Problem Using Newton Homotopy Differential Equation by Hasan, Talib Hashim, Chowdhury, Md. Sazzad Hossien, Prayoto, .

    Published 2011
    “…An ordinary differential equation based on Newton homotopy is used for following the solution path. Our homotop algorithm is much more efficient than the conventional iterations type algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Attack path selection optimization with adaptive genetic algorithms

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…This paper describes our project that has the ultimate goal of providing optimized solutions for enterprise network security. We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Attack path selection optimization with adaptive genetic algorithms

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…This paper describes our project that has the ultimate goal of providing optimized solutions for enterprise network security. We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…In this paper, GA has been applied to find the minimum path, then result will be compared with Dijkstra's algorithm are presented.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: