Implementasi Algoritma Greedy pada Rute Wisata Danau Tao Desa Batang Onang Baru Berbasis Website
-
Riska Novasari Siregar
*
Program Studi Teknik Informatika, Fakultas Teknik dan Komputer, Universitas Harapan Medan,
Indonesia
- Rahmat Aulia Program Studi Teknik Informatika, Fakultas Teknik dan Komputer, Universitas Harapan Medan, Indonesia
- Rosyidah Siregar Program Studi Teknik Informatika, Fakultas Teknik dan Komputer, Universitas Harapan Medan, Indonesia
Abstract
This study aims to facilitate the travel of tourists visiting Tao Lake and increase travel efficiency by determining the fastest route. One of the methods used to determine the fastest route to Tao Lake is the greedy algorithm method. The advantage of the greedy algorithm is that it is fast in acting and does not take long to consider the consequences of what is decided so that it is very easy to implement in several existing problems. This website was created for the Gunung Tua and Padang Sidempuan areas. The results of the trial of the Tao Lake tourism website using a black box stated that the results of the website's feasibility point were 54% strongly agree, 26% agree, 14% disagree and 6% strongly disagree. The results of the website user satisfaction point were 58% strongly agree, 32% agree, 6% disagree and 4% strongly disagree.
References
W. Hadi and H. Widyaningsih, “Implementasi Penerapan Sapta Pesona Wisata Terhadap Kunjungan Wisatawan Di Desa Sambirejo Kecamatan Prambanan Kabupaten Sleman Daerah Istimewa Yogyakarta,” J. Pariwisata dan Budaya, vol. 11, no. September, pp. 127–136, 2020, doi: 10.31294/khi.v11i2.8862.
S. Susilawati, “Penerapan Metode A*Star Pada Pencarian Rute Tercepat Menuju Destinasi Wisata Cagar Budaya Menes Pandeglang,” Geodika J. Kaji. Ilmu dan Pendidik. Geogr., vol. 4, no. 2, pp. 192–199, 2020, doi: 10.29408/geodika.v4i2.2754.
F. Nova Arviantino, W. Gata, L. Kurniawati, Y. A. Setiawan, and D. Priansyah, “Penerapan Algoritma Greedy Dalam Pencarian Jalur Terpendek Pada Masjid–Masjid Di Kota Samarinda,” Metik J., vol. 5, no. 1, pp. 8–11, 2021, doi: 10.47002/metik.v5i1.188.
R. D. Saktia Purnama et al., “Implementasi Penggunaan Algoritma Greedy Best First Search Untuk Menentukan Rute Terpendek Dari Cilacap Ke Yogyakarta,” J. Inform. dan Tek. Elektro Terap., vol. 12, no. 2, 2024, doi: 10.23960/jitet.v12i2.4068.
A. Thariq and R. Nende, “Pengembangan Aplikasi Pencarian Tempat Kuliner Terdekat Di Kota Ambon Menggunakan Algoritma Greedy Berbasis Android Development of the Nearest Culinary Place Find Application in Ambon City Using Greedy Algorithm Based on Android,” IJIS Indones. J. Inf. Syst., vol. 9, no. April, pp. 35–46, 2024.
F. D. Sianipar et al., “ESTIMASI RUTE TERDEKAT DARI UNIVERSITAS NEGERI MEDAN KE SPBU TERDEKAT MENGGUNAKAN ALGORITMA GREEDY,” vol. 8, no. 6, pp. 12218–12225, 2024.
M. N. Kafi, A. Id Hadiana, and H. Ashaury, “Penentuan Rute Tercepat Untuk Responden Pertama Menggunakan Algoritma a* (a-Star),” JATI (Jurnal Mhs. Tek. Inform., vol. 8, no. 4, pp. 7914–7923, 2024, doi: 10.36040/jati.v8i4.10492.
Y. Y. Seran, “Sistem Pendukung Keputusan Cerdas Penentuan Rute Tercepat Menggunakan Metode Grey Absolute Decision Analysis,” Media Online), vol. 01, no. 33, pp. 33–44, 2024.
A. E. Prasetya, “Pencarian Rute Tercepat Mobil Ambulance Menggunakan Algoritma Ant Colony Optimization,” JURIKOM (Jurnal Ris. Komputer), vol. 6, no. 4, pp. 381–388, 2019, [Online]. Available: https://ejurnal.stmik-budidarma.ac.id/index.php/jurikom/article/view/1252
I. Algoritma, A. A-star, Z. Arfadhillah, and Y. Akbar, “Tercepat dari Bandara Soekarno Hatta ke Destinasi Kota Tua,” vol. 5, no. 3, pp. 3020–3042, 2024.
Salmon Priaji Martana, “Problematika Penerapan Metode Field Research Untuk Penelitian Arsitektur Vernakular Di Indonesia,” Dimens. (Jurnal Tek. Arsitektur), vol. 34, no. 1, pp. 59–66, 2006, [Online]. Available: http://puslit2.petra.ac.id/ejournal/index.php/ars/article/view/16458
R. B. Oktaviandi, M. S. T. Hadi, A. G. Santoso, and N. El Maidah, “Perbandingan Algoritma Genetika dengan Algoritma Greedy Untuk Pencarian Rute Terpendek,” INFORMAL Informatics J., vol. 3, no. 1, p. 6, 2019, doi: 10.19184/isj.v3i1.9847.
D. Grace, “Sakit Di Kota Palu Menggunakan Algoritma Greedy Berbasis Web,” J. Elektron. Sist. Inf. dan Komput., vol. 4, no. 2, pp. 59–76, 2021.
R. Dwi Septiana, D. Abisono Punkastyo, and N. Nugroho, “Algoritma Greedy dan Algoritma A* Untuk Penentuan Cost Pada Routing Jaringan,” KLIK Kaji. Ilm. Inform. dan Komput. Implementasi, vol. 3, no. 2, pp. 181–187, 2022, [Online]. Available: https://djournals.com/klik
N. N. Sania and I. Sari, “Implementasi Rencana Perjalanan Wisata Di Kota Bogor Menggunakan Algoritma Greedy Berbasis Website,” J. Ilm. Teknol. dan Rekayasa, vol. 24, no. 2, pp. 114–130, 2019, doi: 10.35760/tr.2019.v24i2.2390.
A. Roihan, K. Nasution, and M. Z. Siambaton, “Implementasi Algoritma Greedy Kombinasi dengan Perulangan pada Aplikasi Penjadwalan Praktikum,” sudo J. Tek. Inform., vol. 1, no. 2, pp. 42–50, 2022, doi: 10.56211/sudo.v1i2.8.
N. Fakhri, A. Sigit Julian, D. Sandi Augustin, Z. Ceryl Mavanudin, and E. Christian, “Penerapan Algoritma Greedy Dalam Penentuan Prioritas Pengerjaan Tugas Kuliah Mahasiswa,” RESOLUSI Rekayasa Tek. Inform. dan Inf., vol. 4, no. 5, p. 454, 2024, [Online]. Available: http://www.djournals.com/resolusi/article/view/1824
Copyright (c) 2025 Riska Novasari Siregar, Rahmat Aulia, Rosyidah Siregar
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors retain copyright and grant the EXPLORER right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 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) the work for any purpose, even commercially with an acknowledgement of the work's authorship and initial publication in EXPLORER.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in EXPLORER.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
.png)
