Search Results - (( java implementation path algorithm ) OR ( program program sabah 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

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

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

    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
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13

    An investigation towards hostel space allocation problem with stochastic algorithms by Joe Henry Obit, Kuan, Yik Junn, Rayner Alfred, Jetol Bolongkikit, Ong, Yan Sheng

    Published 2018
    “…The construction of initial solution is handled by Constraint Programming algorithm. Two algorithms mainly Great Deluge with linear and non-linear decay rate and Simulated Annealing with linear reduction are proposed to improve the quality of solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14
  15. 15
  16. 16

    Performance comparison of linear and non-linear great deluge algorithms in solving university course timetabling problems by Joe Henry Obit, Yik Junn Kuan, Rayner Alfred

    Published 2017
    “…This research does not focus on hard constraints involved as the initial solution is solved based on Constraint Programming algorithm. The GD algorithm is tested over three benchmark datasets: testing dataset; semester 2 session 2014/2015 test set; semester 1 session 2015/2016 test set. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    A performance comparison of metaheuristics search for university course timetabling problems by Joe Henry Obit, Kuan Yik Junn, Rayner Alfred

    Published 2017
    “…In this research, a Constraint Programming (CP) algorithm is proposed and implemented in order to solve the hard constraint while satisfying the soft constraints is handled by using the Great Deluge (GD) algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20