Implementasi Algoritma Kruskal Dalam Menentukan Rute Terdekat Pada Tempat Pariwisata di Daerah Lombok Tengah
Abstract
When visiting several tourist attractions at once with limited time and an irregular schedule, of course, visitors choose the closest route to be able to visit all the places to be visited at once. This study uses an algorithm, namely the Kruskal algorithm, which aims to find the closest route to visit the five tourist attractions at once in Central Lombok Regency. The tourist attractions in question are Tanjung Aan Beach, Kuta Mandalika Beach, Sukarara Village, Sade Hamlet, Benang Kelambu Waterfall. This type of research is applied research which is generally a type of descriptive research that encourages further research. This study applies a modified Kruskal algorithm so as to produce 4 alternative closest routes with different starting points to be able to visit the five tourist attractions at once in Central Lombok Regency, namely 1) If the journey starts from Tanjung Aan Beach or Benang Kelambu Waterfall, the closest route is 60,1 km; 2) If the journey starts from Kuta Mandalika Beach, the closest route is 73.6 km; 3) If the journey starts from Sade Hamlet, the closest route is 73.6 km; 4) If the journey starts from Sukarara Village, the closest route is 82.9 km
References
Akpan, N. P., & Iwok, I. A. (2017). A minimum spanning tree approach of solving a transportation problem. International Journal of Mathematics and Statistics Invention, 5(3), 9–18.
Amrullah, Azmi, S., Soeprianto, H., Turmuzi, M., & Anwar, Y. S. (2019). The partition dimension of subdivision graph on the star. Journal of Physics: Conference Series, 1280(2). https://doi.org/10.1088/1742-6596/1280/2/022037
Anggito, A., & Setiawan, J. (2018). Metodologi Penelitian Kualitatif. CV Jejak.
Buol, A. A., Rumba, M. F., & Wara, F. A. (2019). Penentuan Panjang Optimal Pipa Air Optimal Di Perumnas Maumere Menggunakan Algoritma Kruskal. Jurnal In Create (Inovasi Dan Kreasi Dalam Teknologi Informasi), 6, 15–21.
Daniel, F., & Taneo, P. (2019). Teori Graf. Deepublish.
Didiharyono, D., & Soraya, S. (2018). Penerapan Algoritma Greedy Dalam Menentukan Minimum Spanning Trees Pada Optimisasi Jaringan Listrik Jala. Jurnal VARIAN, 1(2), 1–10. https://doi.org/10.30812/varian.v1i2.66
Disparbud. (2020). Statistika Kepariwisataan Kabupaten Lombok Tengah Tahun 2019. DISPARBUD Kabupaten Lombok Tengah.
Fuad, M. A., Sartimbul, A., Iranawati, F., Sambah, A. B., Yona, D., & Hidayati, N. (2019). Metode Penelitian Kelautan dan Perikanan. UB Press.
Hayu, W., Yuliani, & Sam, M. (2017). Pembentukan Pohon Merentang Minimum Dengan Algoritma Kruskal. Jurnal Scientific Pinisi, Vol 3(1994), 108–115.
Hidayat, R. K., Makhrus, M., & Darmawan, M. I. (2021). Pelaksanaan Pengenalan Lapangan Persekolahan (PLP) FKIP Universitas Mataram Bidang Studi Pendidikan Fisika di MAN 1 Lombok Timur. Jurnal Penelitian Dan Pembelajaran Fisika Indonesia, 3(1). https://doi.org/10.29303/jppfi.v3i1.115
Mahardika, F. (2019). Penerapan Teori Graf Pada Jaringan Komputer Dengan Algoritma Kruskal. Jurnal Informatika: Jurnal Pengembangan IT, 4(1), 48–53. https://doi.org/10.30591/jpit.v4i1.1032
Marsudi. (2016). Teori Graf. Universitas Brawijaya Press.
Murdiasih, H. (2019). Pesona Pulau Lombok. Penerbit Duta.
Putra, E. D. A., Ernawati, & Coastera, F. F. (2016). Penerapan Open Street Map untuk Mencari Lokasi ATM Terdekat dengan Algoritma Kruskal Berbasis Smartphone Android (Studi Kasus: Lokasi ATM di Kota Bengkulu). Jurnal Rekursif, Vol. 4, 196–208.
Siregar, M. K. (2018). Matematika Diskrit. Tunas Asri.
Sudaryono, D. (2016). Metode Penelitian Pendidikan. Kencana.
Suwena, I., & Widyatmaja, I. N. (2017). Pengetahuan Dasar Ilmu Pariwisataan. Pustaka Larasan.
