Application of Dijkstra Algorithm in Determining Transportation Costs for Tourist Attractions in Lombok Island Based on the Shortest Path
Article Sidebar
Main Article Content
Abstract
Purpose: Lombok Island is known as an attractive tourist destination with natural beauty and unique culture. The growth of the tourism sector is very important for regional economic development. Lombok Island often faces challenges in its transportation system, including complex routes, varying road conditions, and traffic problems.
Method: In this research, the data used were 30 tourist attractions on the island of Lombok sourced from the Tourism Office. Tourist attractions in Lombok are represented by vertices in the graph. Then the edges represent roads connecting tourist attractions and the weights represent the cost of getting to each tourist attraction from a starting vertex. Then, to determine the minimum transportation cost for each tourist attraction based on this graph, we use Dijkstra algorithm based on the shortest path for each tourist attraction.
Result: The minimum transportation costs for each tourist attraction are obtained based on the shortest route for each tourist attraction on Lombok Island.
Contribution: The application of Dijkstra algorithm can be a solution to overcome some of these challenges by determining the shortest path and optimizing transportation costs.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
References
Chartand, G. dan Zhang, P. 2006. Introduction to Graph Theory, New York: Tata McGraw-Hill Companies Inc.
Destinasi Wisata. 2023. Diakses pada 8 November 2023 dari http://www.disbudpar.ntbprov.go.id/category/destinasi-wisata/
Dewi, L.J.E. 2010. Pencarian Rute Terpendek Tempat Wisata di Bali dengan Menggunakan Algoritma Dijkstra. Prosiding Seminar Nasional Aplikasi Teknologi Informasi 2010, 19 Juni 2010, Yogyakarta, pp. D46-D49.
Fikri, D., Soepriyanto, H. Turmuzi, M., dan Amrullah. 2023. Implementasi Algoritma Dijkstra dalam Menentukan Biaya Tranportasi Berdasarkan Rute Terpendek pada Tempat Wisata di Daerah Lombok Tengah. Jurnal Ilmiah Profesi Pendidikan, 8(3): 470-476.
Masyhudi, L. dan Khalik, W. 2018. Penentuan Rute Wisata Minimum di Pulau Lombok Nusa Tenggara Barat dengan Pendekatan Algoritma Dijkstra. Media Bina Ilmiah, 12(12): 689-698.
Munir, R., 2009. Matematika Diskrit, Edisi 3, Informatika, Bandung.
Mursy, L. A. A, Kholiq, H., Saptyaningtyas, D. A., Juliana, R., Sulisdiana, M., dan Romdhini, M. U. 2019. Menentukan Rute Terpendek Pendistribusian Bahan Bangunan oleh PT.Sadar Jaya Manunggal Mataram Menggunakan Algoritma Branch and Bound. Eigen Mathematics Journal, 2(1): 54-60.
Musabbikhah, L. dan Yuliantari, R.V. 2022. Analisis Penggunaan Algoritma Dijkstra untuk mencari Rute Terpendek di Rumah Sakit. Jurnal Edu Elektika, 11(1): 1-5.
Nugroho, M. S., Mas’ud, R., Khalik, W., Fahdiansyah, R., Azizoma, R., Romdhini, M. U., dan Aminy, M. M. 2022 Coastal Tourism: Development Strategy of Loang Baloq Beach in Lombok Island, Indonesia. Journal of Environmental Management and Tourism, 4(60): 949-965.
Susanto, L.A.W., Ursia, A. A., Tyas, A. K., Usdinoari, C. O. P., Prasetyo, D. A. B., dan Nugraha, A. S. 2022. Implementasi Algoritma Dijkstra dalam menentukan Rute Terpendek Objek Wisata Menggunakan Transportasi Transjakarta. Seminar Nasional Pendidikan Matematika, 1 Januari 2022, 3(1): 279-290.