Search Results - (( its application ((search algorithm) OR (path algorithm)) ) OR ( _ application out algorithm ))*

Search alternatives:

Refine Results
  1. 1
    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems

    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

    Published 2016
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    Published 2018
    “…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  3. 3
    Comparison of path planning in simulated robot

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…This is because each path planning algorithm has its own applicable domain, performance, advantages and disadvantages in various situations. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  4. 4
    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…Definitely this best first search algorithm saves the searching time and improves performance of shortest path finding.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios

    Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios by Yusuf, Zakariah, Mohamad, Sufian, Wan Ibrahim, Wan Suhaifiza

    Published 2025
    “…On the other hand, Dijkstra's algorithm, though robust and optimal, exhibited longer runtimes and produced paths with more turns due to its exhaustive search approach. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    “…Dijkstra’s algorithm is one of the classic shortest path search algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Simulated Kalman Filter algorithms for solving optimization problems

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…Its optimality has inspired the development of a metaheuristic algorithm called Heuristic Kalman Algorithm (HKA) in 2009. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Prospective use of bloom filter and muxing for information centric network caching

    Prospective use of bloom filter and muxing for information centric network caching by Abdullahi, Ibrahim, Hassan, Suhaidi, Arif, Suki

    Published 2015
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    The Hybrid of WOABAT-IFDO Optimization Algorithm and Its Application in Crowd Evacuation Simulation

    The Hybrid of WOABAT-IFDO Optimization Algorithm and Its Application in Crowd Evacuation Simulation by Hamizan, Sharbini, Roselina, Sallehuddin, Habibollah, Haron

    Published 2023
    Get full text
    Get full text
    Get full text
    Proceeding
    Save to List
    Saved in:
  10. 10
    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan

    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

    Published 2017
    “…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    An improved electromagnetism-like mechanism algorithm for the optimization of maximum power point tracking / Tan Jian Ding

    An improved electromagnetism-like mechanism algorithm for the optimization of maximum power point tracking / Tan Jian Ding by Tan, Jian Ding

    Published 2017
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    An analysis of the parameter modifications in varieties of harmony search algorithm

    An analysis of the parameter modifications in varieties of harmony search algorithm by Mansor, N. F., Abal Abas, Zuraida, Abdul Rahman, Ahmad Fadzli Nizam, Shibghatullah, Abdul Samad, Safiah , Sidek

    Published 2014
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    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
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    Hybridizing Invasive Weed Optimization with Firefly Algorithm for Unconstrained and Constrained Optimization Problems

    Hybridizing Invasive Weed Optimization with Firefly Algorithm for Unconstrained and Constrained Optimization Problems by Hyreil A., Kasdirin, N. M., Yahya, M. S. M., Aras, Tokhi, M. O.

    Published 2017
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Reducing Iteration Using Candidate List

    Reducing Iteration Using Candidate List by Md Rais, Helmi, Ali Othman, Zulaiha, Hamdan, Abdul Razak

    Published 2008
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system

    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar, Weria, Tang, Sai Hong, Mohamed Sahari, Khairul Salleh, Khaksar, Mansoor, Toressen, Jim

    Published 2019
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…This indicates the capability of the algorithm in exploring the search space. The 2S-ENDSHHMO algorithm can be used to improve the search process of other MOSI-based algorithms and can be applied to solve MOPs in applications such as structural design and signal processing.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…This research proposes the enhanced metaheuristic algorithms that exploit the power of Tabu Search, Genetic Algorithm, and Simulated Annealing for solving VRPSD. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:

Search Tools: