Comparison of Dijkstra and Floyd Algorithm for Finding The Optimal Route of Tourism Public Transportation in Banyumas
Utti Marina Rifanti
Institut Teknologi Telkom Purwokerto
Abstract
Tourism is a significant contributor to Indonesian economy as well as a significant source of its foreign exchange earnings. Banyumas that located in Central Java is one of the regions in Indonesia with great tourism potential. There are lot of tourism destinations in there, such as Baturraden, Small World, Andang Pangrenan, The Village, Caping Park, and many more. Unfortunately, there are no public transportation facilities to go there. Public transportation for the tourism is the main facilities for visitors. It can also reduce congestion during holidays. It plays an essential role in city tourism development. The important thing to do before building a public transportation is to determine the optimal route. Scientific contributions are needed to develop it. One of the fields of study about it is graph theory. It is a branch of discrete mathematics. It is usually use in modeling of phenomena in real life. In transportation it is most commonly used to study problems. The aim of this paper is to provide the optimal public transportation route for the tourism in Banyumas. We have used Dijkstra and Floyd algorithm in order to compare the performance of optimal public transportation route.
Keywords: Graph theory; Dijkstras algorithm; Floyds algorithm; Route; Tourism
Topic: Sciences