Dijkstra‘s Algorithm for Effective Travelling
to the Most Famous Destinations in Myanmar

San San Maw; Khin Saw Lin; Lin Lin Naing

doi:https://doi.org/10.14445/22315373/IJMTT-V65I8P502

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 65 | Issue 8 | Year 2019 | Article Id. IJMTT-V65I8P502 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I8P502

Dijkstra‘s Algorithm for Effective Travelling to the Most Famous Destinations in Myanmar

San San Maw, Khin Saw Lin, Lin Lin Naing

Citation :

San San Maw, Khin Saw Lin, Lin Lin Naing, "Dijkstra‘s Algorithm for Effective Travelling to the Most Famous Destinations in Myanmar," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 8, pp. 4-12, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I8P502

Abstract

In this paper,the well-known Dijkstra’s Algorithm is applied to find the optimal paths for travelling to the most famous destinations in Myanmar. It is aSingle-Source Shortest Path (SSSP) iterative algorithm and the basic idea is searching a graph by findingpath, starting at a point, and exploring adjacent nodes from there until the destination node is reached. Generally, the goal is to obtain the shortest path from current city to the other destinations. This algorithm can bereviewed with values which come from weights on edges according to actual situations on the road, such as costs, distances, and travelling time. The key issue to be addressed in this work is to find the shortest paths from one source point (city/place) to others by comparing the weighted values (i.e., distances and time) between any two different paths with their edge lengths (roads) that assigned by actual values for saving cost and time for effective travelling. The values of distances and time between any two destinations are taken from Myanmar distance calculator website and compared the accuracy of the results using those values in Google Map.

Keywords

Path Finding, Weighted Graph, Routing, Shortest Paths, Dijkstra’s Algorithm.

References

[1] E.Kreyszig, Advanced Engineering Mathematics, 10th edition.John Wiley & Sons, Inc., 2011.
[2] MeysamEffati, "Analysis of Uncertainty Considerations in Path Finding Applications".5th SASTech 2011, Khavaran Higher-education Institute, Mashhad, Iran. May 12-14.
[3] MyintThanKyi, Lin Lin Naing, "Application of Ford-Fulkerson Algorithm to Maximum Flow in Water Distribution Pipeline Network‖, International Journal of Scientific and Research Publications (IJSRP), Vol. 8, Issue 12, pp-306-310, December, 2018.[Online]. Available: http://www.ijsrp.org/research-paper-1218/ijsrp-p8441.pdf
[4] P. Sharma, A.Planiya, "Shortest Path Finding of Wireless Optical Network using Dijkstra Algorithm and Analysis of Delay and Blocking Probability",International Journal of Research and Scientific Innovation (IJRSI).Vol. 3, Issue 4, April 2016.
[5] Solving Shortest Path Problem: Dijkstra‘sAlgorithm, Lecture Note on Operations Research Methods. October 23, 2009. [Online]. Available: https://www.ifp.illinois.edu/~angelia/ge330fall09_ dijk- stra_l18.pdf
[6] (2012) Myanmar Map, Map No. 4168 Rev. 3 United Nation.[Online]: Available: http://www.un.org/Depts/Cartographic/map/profile/ myanmar.pdf
[7] M. Muthulakshm, M.M. Shanmugapriya, "Shortest Path Algorithm and its implementation", International Journal of Mathematics Trends and Technology (IJMTT) – Vol. 36 No. 2- August 2016.
[8] (2019) Dijkstra‘sAlgorothmWikipedia website.[Online]. Available: https://en.mwikipedia.org/ wiki/Dijkstar% 27s_algorithm
[9] Vladimir V. Riabov, "Exploring Algorithms for Effective Applicationof the Graph Theory.26th International Conference on Technology in Collegiate MathematicsRivier University, USA.
[10] A.Madkour, A Survey of Shortest-Path Algorithms, USA. 2017.[Online]. Available: https://arxiv.org/pdf/1705.02044.pdf [11] Vi Ngoc-Nha Tran, Soufiene Djahel,John Murphy,"A comparative study of vehicles' routing algorithms for route planning in smartcities", Conference Paper · November 2012.[Online]. Available: https://www.researchgat e.net/figure/Flowchart-illustrating-the-best-route-update-during-the -vehicles-journey_fig3_271458021
[12] Dijkstra‘s Shortest Path Algorithm, CLRS 24.3, Lecture note: [Online]. Available: https://www.cse.ust.hk/~dekai/271/notes/L10.
[13] (2018) Myanmar Distance Calculator website. [Online]. Available: https://distance calculator.globefeed.com/Myanmar_ Distance_Calculator.asp [14] Zafar Ali, ―Comparison of Dijkstra's Algorithm with other proposed algorithms‖,International Academic Journal of Science and Engineering. Vol. 3, No. 7, 2016, pp. 53-66.