Comparative Analysis of Bellman-Ford and Dijkstra Algorithms to Determine the Shortest Tourist Path in Central Lombok
Article Sidebar
Main Article Content
Abstract
Purpose: Central Lombok Regency has many tourist attractions spread out, which often makes it difficult for tourists to determine the best travel route to visit several locations at once. Choosing the shortest route is an important factor because it can save time, energy, and fuel costs, especially in tourist trips with unstructured schedules. Therefore, an effective method is needed to determine the shortest route to improve the efficiency of tourist trips. This study analyzes the shortest route to tourist attractions in Central Lombok Regency using two popular graph algorithms, including Dijkstra Algorithm and Bellman-Ford Algorithms
Method: In this study, the data used are 6 tourist attractions in Central Lombok Regency. Tourist attractions are represented by points on the graph. Then the edge represents the road connecting the tourist attractions and the weight represents the distance to each tourist attraction from a starting point. Then to determine the minimum shortest distance of each tourist attraction based on the graph, Dijkstra and Bellman-Ford algorithms are used.
Result: The shortest path to tourist attractions in Central Lombok Regency is obtained based on the Dijkstra and Bellman-Ford Algorithms.
Contribution: Through this analysis, the advantages and disadvantages of the two algorithms in the context of determining tourist routes in Central Lombok can be identified.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
References
Afdhaluzzikri, M., Santriawan, L. D., Sapni, E., Nugroho, M. S., dan Romdhini, M. U. 2024. Penerapan Algoritma Dijkstra Dalam Penentuan Biaya Transportasi Objek Wisata Di Pulau Lombok Berdasarkan Rute Terpendek. Juwita Jurnal Pariwisata Nusantara, 3(2), 67-73. https://doi.org/10.20414/juwita.v3i2.11017
Al Hakim, R. R., Satria, M. H., Arief, Y. Z., Pangestu, A., Jaenul, A.. Hertin, R. D., dan Nugraha, D. 2021. Aplikasi Algoritma Dijkstra dalam Penyelesaian Berbagai Masalah. Expert Jurnal Manajemen Sistem Informasi dan Teknologi, 11(1).
https://doi.org/10.36448/expert.v11i1.1939.
Anggraini, F. dan Mingparwoto, S. 2015. Penerapan Metode Algoritma Bellman–Ford Dalam Aplikasi Pencarian Lokasi Perseroan Terbatas di PT. Jakarta Industrial Estate Pulogadung (PT. JIEP). Jurnal Teknologi, 7(1), 28-34.
https://jurnal.umj.ac.id/index.php/jurtek/article/view/368
Chandra, S. A., Mulyono, M. dan Suyitno, A. 2017. Implementasi Algoritma Dikstra Dalam Pencarian Rute Terpendek Tempat Wisata Di Kabupaten Gunungkidul Dengan Program Visual Basic. Unnes Journal of Mathematics, 6(2), 108-116.
https://doi.org/10.15294/ujm.v6i2.11767
Chartand, G. dan Zhang, P. 2006. Introduction to Graph Theory, New York: Tata McGraw-Hill Companies Inc.
Hasanah, R. 2019. Kearifan Lokal Sebagai Daya Tarik Wisata Budaya Di Desa Sade Kabupaten Lombok Tengah. DESKOVI: Art and Design Journal, 2(1): 45–52. https://doi.org/10.51804/deskovi.v2i1.409
Hamdi, S. dan Prihandoko, P. 2018. Analisis Algoritma Dijktra dan Algoritma Bellman-Ford Sebagai Penentuan Jalur Terpendek Menuju Lokasi Kebakaran (Studi Kasus: Kecamatan Praya Kota), Energy: Jurnal Ilmiah Ilmu-Ilmu Teknik, 8(1), 26-32. https://ejournal.upm.ac.id/index.php/energy/article/view/113
Masri, M., Kiswanto, A. dan Kusuma, B. S. 2019. Implementasi Algoritma Dijkstra Dalam Perancangan Aplikasi Penentuan Rute Terpendek Pada Objek Pariwisata Danau Toba dan Sekitarnya. SEMNASTEK UISU 2019.
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. https://doi.org/10.29303/emj.v1i1.24
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.
https://doi.org/10.14505/jemt.v13.4(60).04
Pramudita, R. dan Safitri, N. 2018. Algoritma Bellman-Ford Untuk Menentukan Jalur Tercepat Dalam Sistem Informasi Geografis. PIKSEL, 6(2), 105–114.
https://doi.org/10.33558/piksel.v6i2.1502
Rois, I. dan Fadliyanti, L. 2017. Dampak Pengembangan Pariwisata Terhadap Pendapatan Asli Daerah (PAD) Di Kabupaten Lombok Tengah, Nusa Tenggara Barat Tahun 2002-2016”, Ekonobis, 3(2), 79-88.
https://doi.org/10.29303/ekonobis.v3i2.8
Serdano, A., Zarlis, M. dan Hartama, D. 2019. Perbandingan Algoritma Dijkstra dan Bellman-Ford Dalam Pencarian Jarak Terpendek Pada SPBU. Proc. Seminar Nasional Sains dan Teknologi Informasi (SENSASI) Agustus 2019, 2(1). http://seminar-id.com/prosiding/index.php/sensasi/article/view/309
Yasti, H., Suteja, I., dan Wahyuningsih, S. 2022. Analisis Daya Saing Pariwisata Kabupaten Lombok Tengah: Pendekatan Competitiveness Monitor. Journal of Responsible Tourism, 1(3), 445-452. https://doi.org/10.47492/jrt.v2i1.1913