An experiment on the performance of shortest path algorithm
Shortest path algorithms are one of the main algorithms used in most navigation system. By implementing these algorithm, the related overall costs such as time and work load can be minimized. The main objective of this paper is to study and experiment the different shortest path algorithm such...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2016
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/20010/1/KMICe%202016%207%2012.pdf |
| _version_ | 1825804290556428288 |
|---|---|
| author | Chan, Simon Yew Meng Adnan, Nur’ayuni Sukri, Syazwan Syafiqah Wan Zainon, Wan Mohd Nazmee |
| author_facet | Chan, Simon Yew Meng Adnan, Nur’ayuni Sukri, Syazwan Syafiqah Wan Zainon, Wan Mohd Nazmee |
| author_sort | Chan, Simon Yew Meng |
| collection | UUM |
| description | Shortest path algorithms are one of the main
algorithms used in most navigation system. By
implementing these algorithm, the related overall
costs such as time and work load can be minimized.
The main objective of this paper is to study and
experiment the different shortest path algorithm such as Dijkstra’s algorithm, Symmetrical Dijkstra’s algorithm, A* algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm and Genetic algorithm in solving the shortest path problem. In this paper, a brief review on each of the shortest path algorithm and its implementation method was discussed.Explanation on how the experiment was conducted and the sample data that involved in the experiment were also presented. The result of the experiment shows the overall performance of each algorithm in solving shortest path problem in term of running time and total distances. The analysis of result shows the performance of each algorithm in order to suggest the most efficient algorithm in solving the shortest path problem |
| first_indexed | 2024-07-04T06:12:09Z |
| format | Conference or Workshop Item |
| id | uum-20010 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:12:09Z |
| publishDate | 2016 |
| record_format | eprints |
| spelling | uum-200102016-11-23T07:51:40Z https://repo.uum.edu.my/id/eprint/20010/ An experiment on the performance of shortest path algorithm Chan, Simon Yew Meng Adnan, Nur’ayuni Sukri, Syazwan Syafiqah Wan Zainon, Wan Mohd Nazmee QA Mathematics Shortest path algorithms are one of the main algorithms used in most navigation system. By implementing these algorithm, the related overall costs such as time and work load can be minimized. The main objective of this paper is to study and experiment the different shortest path algorithm such as Dijkstra’s algorithm, Symmetrical Dijkstra’s algorithm, A* algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm and Genetic algorithm in solving the shortest path problem. In this paper, a brief review on each of the shortest path algorithm and its implementation method was discussed.Explanation on how the experiment was conducted and the sample data that involved in the experiment were also presented. The result of the experiment shows the overall performance of each algorithm in solving shortest path problem in term of running time and total distances. The analysis of result shows the performance of each algorithm in order to suggest the most efficient algorithm in solving the shortest path problem 2016-08-29 Conference or Workshop Item PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/20010/1/KMICe%202016%207%2012.pdf Chan, Simon Yew Meng and Adnan, Nur’ayuni and Sukri, Syazwan Syafiqah and Wan Zainon, Wan Mohd Nazmee (2016) An experiment on the performance of shortest path algorithm. In: Knowledge Management International Conference (KMICe) 2016, 29 – 30 August 2016, Chiang Mai, Thailand. http://www.kmice.cms.net.my/kmice2016/files/KMICe2016_eproceeding.pdf |
| spellingShingle | QA Mathematics Chan, Simon Yew Meng Adnan, Nur’ayuni Sukri, Syazwan Syafiqah Wan Zainon, Wan Mohd Nazmee An experiment on the performance of shortest path algorithm |
| title | An experiment on the performance of shortest path algorithm |
| title_full | An experiment on the performance of shortest path algorithm |
| title_fullStr | An experiment on the performance of shortest path algorithm |
| title_full_unstemmed | An experiment on the performance of shortest path algorithm |
| title_short | An experiment on the performance of shortest path algorithm |
| title_sort | experiment on the performance of shortest path algorithm |
| topic | QA Mathematics |
| url | https://repo.uum.edu.my/id/eprint/20010/1/KMICe%202016%207%2012.pdf |
| work_keys_str_mv | AT chansimonyewmeng anexperimentontheperformanceofshortestpathalgorithm AT adnannurayuni anexperimentontheperformanceofshortestpathalgorithm AT sukrisyazwansyafiqah anexperimentontheperformanceofshortestpathalgorithm AT wanzainonwanmohdnazmee anexperimentontheperformanceofshortestpathalgorithm AT chansimonyewmeng experimentontheperformanceofshortestpathalgorithm AT adnannurayuni experimentontheperformanceofshortestpathalgorithm AT sukrisyazwansyafiqah experimentontheperformanceofshortestpathalgorithm AT wanzainonwanmohdnazmee experimentontheperformanceofshortestpathalgorithm |