Perencanaan Rute Optimal Kunjungan Destinasi Wisata Bandung dengan Algoritma Dijkstra Pada C++
Abstract
Bandung, as one of the attractive and popular tourist destinations in Indonesia with a variety of destination choices. The development of the tourism sector in Bandung does not only focus on attracting tourists, but also includes improving infrastructure and accommodation facilities. With more than 825 tourist destinations in Bandung, visiting tourists realize how important it is to choose the best route to maximize their travel experience. This research focuses exclusively on discussing the application of the Dijkstra Algorithm with the C++ programming language to increase travel efficiency to tourist destinations in Bandung. Dijkstra's algorithm is a very effective method in determining the shortest route and is widely used. Performance comparison between Dijkstra's Algorithm and other algorithms shows the significant superiority of Dijkstra's Algorithm. This advantage can be attributed to the use of non-negative weights and the simple and easy to understand nature of the graph, making this research relevant and has the potential to make a positive contribution in improving the tourist experience in Bandung.
Downloads
References
A. A. Pratiwi, W. Yahya, and M. Data, "Analisis perbandingan kinerja algoritme dijkstra, bellman-ford, dan floyd-warshall untuk penentuan jalur terpendek pada arsitektur jaringan software defined network," Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer, vol. 3, no. 1, pp. 809-814, 2019.
A. Cantona, F. Fauziah, and W. Winarsih, "Implementasi algoritma dijkstra pada pencarian rute terpendek ke museum di Jakarta," Jurnal Teknologi dan Manajemen Informatika, vol. 6, no. 1, pp. 27-34, 2020.
A. Y. Firwanda, C. Prianto, and W. I. Rahayu, "Penentuan rute terpendek lokasi badan pusat statistik Kota Bandung dengan algoritma dijkstra," Jurnal Teknik Informatika (JUTEKIN), vol. 9, no. 1, 2021.
Azdy, R. A., & Darnis, F. (2019). Implementasi Bellman-Ford untuk Optimasi Rute Pengambilan Sampah di Kota Palembang. JNTETI (Jurnal Nasional Teknik Elektro Dan Teknologi Informasi), 8(4), 327. https://doi.org/10.22146/jnteti.v8i4.532
Diskominfo Kab. Bandung, “Ekonomi | portal satu data Kab. Bandung,” Bandungkab.go.id,2023. https://satudata.bandungkab.go.id/dataset/jumlah-destinasi-keseluruhan (accessed Dec. 12, 2023).
Eko Sulistyono Sulistyono, “Model Rute Perjalanan Minimal Dengan Menggunakan Vehicle Routing Problem Pada PT X,” Jurnal Teknologi Dan Sistem Informasi Bisnis, vol. 4, no. 2, pp. 293–299, Jul. 2022
H. Pratiwi, “Application Of The Dijkstra Algorithm To Determine The Shortest Route From City Center Surabaya To Historical Places,” Jurnal Teknologi Dan Sistem Informasi Bisnis, vol. 4, no. 1, pp. 213–223, Jan. 2022.
H. S. Sidhu and G. Krishan, "Research on Dijkstra’s, A, “Bellman-ford, and floyd-warshall path finding algorithms," International Research Journal of Modernization in Engineering Technology and Science, vol. 04, no. 01, pp. 1-5, 2022.
Mahmudah, H., Ibrahim, M. F., Puspitorini, O., Wijayanti, A., & Siswandari, N. A. (2022). Penerapan Floyd-Warshall untuk Pencarian Rute Terpendek pada Aplikasi Notifikasi Kecelakaan Lalu Lintas. JNTETI (Jurnal Nasional Teknik Elektro Dan Teknologi Informasi), 11(4), 251–257. https://doi.org/10.22146/jnteti.v11i4.2201
M. C. Bunaen, H. Pratiwi, and Y. F. Riti, "Penerapan algoritma dijkstra untuk menentukan rute terpendek dari pusat Kota Surabaya ke tempat bersejarah," Jurnal Teknologi Dan Sistem Informasi Bisnis, vol. 4, no. 1, 2022.
M. Mohamad, I. Ahmad, and Y. Fernando, "Pemetaan potensi pariwisata Kabupaten Waykanan menggunakan algoritma dijkstra," Jurnal Komputer Terapan, vol. 3, no. 2, pp. 169-178, 2017.
Mutiara Yetrina and Defby Seswita Nainggolan, “Penentuan Rute Distribusi Untuk Meminimasi Biaya Distribusi di UKM Habil Snack,” Jurnal Teknologi Dan Sistem Informasi Bisnis, vol. 3, no. 1, pp. 247–253, Jan. 2021.
Muzakir, A., & Hutrianto, H. (2020). Bellman-Ford Algorithm for completion of route determination: an experimental study. JITEKI : Jurnal Ilmiah Teknik Elektro Komputer Dan Informatika, 6(1), 29. https://doi.org/10.26555/jiteki.v16i1.16943
N. Maesari, D. Suganda, and C. U. Rakhman, "Pengembangan wisata edukasi berkelanjutan di museum geologi Bandung," Jurnal Kepariwisataan: Destinasi, Hospitalitas Dan Perjalanan, vol. 3, no. 1, pp. 8-17, 2019.
“Open data Provinsi Jawa Barat,” opendata.jabarprov.go.id. https://opendata.jabarprov.go.id/id/dataset/jumlah-tempat-rekreasi-berdasarkan-kabupatenkota-di-jawa-barat (accessed Dec. 12, 2023).
“Open data,” opendata.cimahikota.go.id. https://opendata.cimahikota.go.id/dataset/jumlah-industri-pariwisata-di-kota-cimahi (accessed Dec. 12, 2023).
Putri, T. D., Sugeng, W., & Safitri, E. (2020). Algoritma Dijkstra untuk Penentuan Jarak Tempuh Terpendek Pengantaran Katering Pabrik. MIND (Multimedia Artificial Intelligent Networking Database) Journal, 5(2), 108-120
R. R. Al Hakim, M. H. Satria, Y. Z. Arief, A. Pangestu, A. Jaenul, R. D. Hertin, and D. Nugraha, "Aplikasi algoritma dijkstra dalam penyelesaian berbagai masalah," Expert, vol. 11, no. 1, p. 345994, 2021.
S. Qory, S. Ulya, W. Royani, and Y. Dewi, "Destinasi pariwisata halal di Kota Bandung," Likuid Jurnal Ekonomi Industri Halal, vol. 1, no. 1, pp. 99-106, 2021.
T. S. Dermawan, "Comparison of dijkstra dan floyd-warshall algorithm to determine the best route of train," IJID (International Journal on Informatics for Development), vol. 7, no. 2, 2019.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under an Attribution 4.0 International (CC BY 4.0) that allows others to share — copy and redistribute the material in any medium or format and adapt — remix, transform, and build upon the material for any purpose, even commercially with an acknowledgment of the work's authorship and initial publication in this journal.
