Application of Floyd-Warshall Iterative Algorithm for Travelling to the Most Popular Tourist Attractions in Myanmar

  IJCTT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)          
 
© 2019 by IJCTT Journal
Volume-67 Issue-7
Year of Publication : 2019
Authors :  Sanda San, San San Maw, Lin Lin Naing
  10.14445/22312803/IJCTT-V67I7P113

MLA

MLA Style: Sanda San, San San Maw, Lin Lin Naing"Application of Floyd-Warshall Iterative Algorithm for Travelling to the Most Popular Tourist Attractions in Myanmar" International Journal of Computer Trends and Technology 67.7 (2019): 80-85.

APA Style Sanda San, San San Maw, Lin Lin Naing. Application of Floyd-Warshall Iterative Algorithm for Travelling to the Most Popular Tourist Attractions in Myanmar International Journal of Computer Trends and Technology, 67(7),80-85.

Abstract
In this paper, well-known Floyd-Warshall algorithm in graph theory isapplied to find the shortest path between two places. This algorithm is an All-Pairs-Shortest-Path (APSP) algorithm and can solveand optimize the efficient solution for the finding the shortest path between all pairs of vertices by taking every road as an edge and every vertex as city or country. Itmakes a table of all the distances between cities on a road map. It also uses a recursive approach to find the shortest distances and minimum time between all nodes in a graph. The goal of this paper is to find the effective ways in travelling for top seven tourists’ attraction places in Myanmar by means of optimizing both distances and time taken between every pair of places using Floyd Warshall iterative algorithm.

Reference
[1] (2019) Tourism in Myanmar website. [Online]. Available: https://en.wikipedia. org/wiki/Tourism_in_Myanmar
[2] OrhanEroglu, ZaferAltugSayar and GurayYilmaz "An Optimization Approach for Airport Ground Operations with A Shortest Path Algorithm", Conference Paper INAIR, Amsterdam,NOV 2015.
[3] (2019)Floyd-Warshall Algorithm website.[Online]. Available:https://en.wikipedia. org/wiki/ Floyd–Warshall_algorithm/
[4] R W. Floyd, "Algorithm 97: shortest path".Communications of the ACM, Volume 5, Issue 6,pp 345, June, 1962.
[5] Eshu Gupta, "Global Positioning System using Dijkstra’s Algorithm Traffic Planning System", International Journal of Computer Trends and Technology (IJCTT), Volume 35, Number 5, pp-231-235, May 2016,
[6] Rongyan Xu ; Dejun Miao ; Lu Liu ; John Panneerselva, "An Optimal Travel Route Plan for Yangzhou Based on the Improved Floyd Algorithm", Proceeding of IEEE International Conference on Internet of Things, 21-23,June, 2017.[Online]. Available: https://ieeexplore. ieee.org/document/8276747
[7] SantanuSaha Ray, Graph Theory with Algorithms and its Applications in Applied Science and Technology, Springer New Delhi Heidelberg New York Dordrecht London, Springer India, 2013.
[8] (2018) Design and Analysis of Floyd-Warshall Shortest Path Algorithm website, [Online]. Available: https://www.gatevidyalay. com/floyd-warshall-algorithm-shortest-path-algorithm/

Keywords
Shortest path, Floyd-Warshall, distance matrix and node sequence matrix, iterative algorithm, tourism