Implementasi Algoritma Dijkstra Pada Pencarian Rute Terpendek Objek Wisata


Authors

  • Rachman Perayoga Universitas Muhammadiyah Magelang, Magelang, Indonesia
  • Purwono Hendradi Universitas Muhammadiyah Magelang, Magelang, Indonesia https://orcid.org/0000-0003-2458-2124
  • Agus Setiawan Universitas Muhammadiyah Magelang, Magelang, Indonesia

DOI:

https://doi.org/10.30865/klik.v4i3.1495

Keywords:

Tourism; Website; Algorithm; Route; Dijkstra

Abstract

The tourism sector has an important role as a source of income to support regional or national economic growth. Indonesia has a variety of natural beauty, one of which is in Temanggung Regency, Central Java. This diversity also forms the need for clear information about the location and types of tourism available. Therefore, an information system is needed that can help find the best path to the tourist site. One efficient approach is through the Dijkstra algorithm to determine the nearest route. Through the determination of the most efficient route, it will certainly have a positive effect, because it can reduce operational budgets and can optimize better travel periods between destinations. To implement the Dijkstra algorithm on the website using the Rapid Application Development (RAD) Method. In the built system, users can see the nearest route point from the initial location to the intended tourist spot, so it is expected to help users in terms of providing information and finding the shortest route from the point of travel. The result of this study is the application of an information system to determine the shortest route on a distance map using the dijkstra algorithm in Temanggung Regency.

Downloads

Download data is not yet available.

References

M. R. Pahlevi and R. T. Komalasari, “Implementasi Algoritma Dijkstra Rute Terpendek pada Aplikasi WisKul PasMing,” vol. 6, no. 4, 2022.

K. Khairullah, A. M. Jaya, N. D. M. Veronika, and Y. Apridiansyah, “Sistem Informasi Geografis Pencarian Rute Terpendek Tempat Pelatihan Pencak Silat Di Kota Bengkulu Menggunakan Metode Dijkstra,” JUKOMIKA (Jurnal Ilmu Komput. dan Inform., vol. 5, no. 1, pp. 30–36, 2022, doi: 10.54650/jukomika.v5i1.434.

N. A. Sudibyo, P. E. Setyawan, and Y. P. S. R. Hidayat, “Implementasi Algoritma Dijkstra dalam Pencarian Rute Terpendek Tempat Wisata di Kabupaten Klaten,” Riemann Res. Math. Math. Educ., vol. 2, no. 1, pp. 1–9, Apr. 2020, doi: 10.38114/riemann.v2i1.49.

K. Anam and O. D. Hartono, “Aplikasi Pemandu Pencarian Wisata Terdekat Berbasis GIS Android Dengan Algoritma Dijkstra,” vol. 3, pp. 91–99, 2019.

M. Masri, A. P. Kiswanto, and B. S. Kusuma, “IMPLEMENTASI ALGORITMA DIJKSTRA DALAM PERANCANGAN PARIWISATA DANAU TOBA DAN SEKITARNYA,” pp. 221–225, 2019.

Y. F. Riti et al., “PERBANDINGAN ALGORITMA DIJKSTRA DAN FLOYD-WARSHALL DALAM MENENTUKAN RUTE TERPENDEK STASIUN GUBENG MENUJU WISATA,” pp. 297–309, 2022.

A. Serdano, M. Zarlis, and D. Hartama, “Perbandingan Algoritma Dijkstra dan Bellman-Ford Dalam Pencarian Jarak Terpendek Pada SPBU,” pp. 259–264, 2019.

A. D. Hartanto, A. Suryamandala, D. Rio, S. Aminudin, A. Yudirianto, and P. Korespondensi, “Implementasi Algoritma Dijkstra Pada Game Pacman Implementation Dijkstra Algorithm in The Pacman Game,” Agustus, vol. 12, no. 2, pp. 170–176, 2019.

M. Syepanda et al., “WISATA KULINER BERBASIS ANDROID MENGGUNAKAN ALGORITMA DIJKSTRA DI KOTA,” vol. 1, no. April, pp. 117–133, 2021, doi: 10.52362/jmijayakarta.v1i2.448.

N. Hayati, M. R. Fanani, and M. Hakim, “Pengembangan Sistem Tata Kelola Jurnal menggunakan Metode Rapid Application Development,” pp. 456–462, 2023.

M. M. Sangiba, D. Sasongko, P. Hendradi, and A. L. A. Haq, “Aplikasi Cyber Counseling Sebagai Solusi Pelayanan Konseling Online Berbasis Android,” JURIKOM (Jurnal Ris. Komputer), vol. 9, no. 3, p. 582, 2022, doi: 10.30865/jurikom.v9i3.4142.

A. Rais Ruli and F. Meilkie Yoseph, “Perancangan Web E-Commerce Penjualan Mengunakan Metode Rad Untuk Yayasan Kasih Anak Kanker Indonesia,” J. Jar. Sist. Inf. Robot., vol. 7, no. 1, pp. 91–98, 2023.

B. Yudistira and Nurahman, “Sistem Informasi Pemesanan Rumah Makan Dapur Eladhia Berbasis Web,” J. Comput. Syst. Informatics, vol. 2, no. 1, pp. 63–69, 2020.

D. Hariyanto, R. Sastra, F. E. Putri, S. Informasi, K. Kota Bogor, and T. Komputer, “Implementasi Metode Rapid Application Development Pada Sistem Informasi Perpustakaan,” J. JUPITER, vol. 13, no. 1, pp. 110–117, 2021.

N. R. F. Ramadhani, E. Prasetyaningrum, and L. Bachtiar, “Sistem Informasi Geografis Apotek di Kotawaringin Timur Berbasis Web,” Build. Informatics, Technol. Sci., vol. 2, no. 2, pp. 141–150, 2020, doi: 10.47065/bits.v2i2.549.

R. T. Aldisa, “Penerapan Metode RAD (Rapid Application Development) Pada Sistem Informasi Promosi dan Pemesanan Makanan Berbasis Website Studi Kasus Restoran Waroenk Anak Kuliahan,” Build. Informatics, Technol. Sci., vol. 3, no. 3, pp. 446–452, 2021, doi: 10.47065/bits.v3i3.1137.

E. C. Galih and R. A. Krisdiawan, “Implementasi Algoritma Dijkstra Pada Aplikasi Wisata Kuningan Berbasis Android,” Nuansa Inform., vol. 12, no. 1, 2018, doi: 10.25134/nuansa.v12i1.1344.

N. H. Adi, M. Giatman, W. Simatupang, A. Afrina, and R. Watrianthos, “Penerapan Metode Dijkstra Pada Jalur Distribusi LPG Untuk Penentuan Jarak Terpendek,” Build. Informatics, Technol. Sci., vol. 3, no. 3, pp. 235–243, 2021, doi: 10.47065/bits.v3i3.1052.

M. A. Aziz, “Implementasi Algoritma Dijkstra dalam Menentukan Rute Terpendek Terhadap Destinasi Wisata Kabupaten Bojonegoro,” vol. 7, no. 2721, 2023.

Y. Anggraini, D. Pasha, D. Damayanti, and A. Setiawan, “Sistem Informasi Penjualan Sepeda Berbasis Web Menggunakan Framework Codeigniter,” J. Teknol. dan Sist. Inf., vol. 1, no. 2, pp. 64–70, 2020, doi: 10.33365/jtsi.v1i2.236.

R. Cipta, S. Hariyono, A. A. Murtopo, S. Surorejo, and R. Juniyanto, “Implementasi Framework Flutter Pada Pengembangan Sistem Informasi Obyek Wisata di Kabupaten Tegal,” pp. 398–407, 2023.


Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Implementasi Algoritma Dijkstra Pada Pencarian Rute Terpendek Objek Wisata

Dimensions Badge

ARTICLE HISTORY


Published: 2023-12-15
Abstract View: 715 times
PDF Download: 900 times