Main Article Content

Abstract

The determination of tourist routes in Pekanbaru is not solely based on identifying the shortest route but also the best route, considering the various challenges in the field, such as potholes, traffic congestion, and the lack of directional signs to tourist destinations. The selection of the best route is crucial to improving travel comfort and efficiency, reducing travel time, and avoiding potential risks that may disrupt the tourist experience. Therefore, this study aims to determine the best route to tourist attractions using the Ant Colony Optimization (ACO) method and rank tourist routes with the Analytic Hierarchy Process (AHP) method. This study integrates two approaches: ACO, which mimics the behavior of ant colonies in finding optimal routes, and AHP, which generates numerical scores to rank alternatives based on how well each alternative meets the decision maker's criteria. The results of this study are expected to help tourists find available facilities at tourist attractions and provide alternative routes that can serve as a reference in determining the best route to the tourist location, thereby enhancing tourist satisfaction and the overall travel experience.

Keywords

ACO AHP Optimasi Rute Wisata Pemilihan Rute Terbaik ACO AHP Optimal Route Selection Tourist Route Optimization

Article Details

Author Biographies

Erzi Hidayat, politeknik caltex riau

Program Studi Teknik InformatikaPoliteknik Caltex Riau, Pekanbaru

Rika Perdana Sari, Politeknik Caltex Riau

Program Studi Teknik InformatikaPoliteknik Caltex Riau, Pekanbaru

Meilany Dewi, Politeknik Caltex Riau

Program Studi Teknik InformatikaPoliteknik Caltex Riau, Pekanbaru

Arif Rahman Hakim, Politeknik Caltex Riau

Program Studi Teknik InformatikaPoliteknik Caltex Riau, Pekanbaru
How to Cite
hidayat, erzi, Perdana Sari, R., Dewi, M., & Hakim, A. R. (2024). RANCANG BANGUN SISTEM INFORMASI PENENTUAN RUTE TERBAIK MENGGUNAKAN ALGORITMA ANT COLONY OPTIMIZATION DAN AHP. Jurnal Komputer Terapan, 10(2), 152–160. https://doi.org/10.35143/jkt.v10i2.6435

References

  1. “Berita Resmi Statistik (Perkembangan Pariwisata Provinsi Riau Januari 2024),” Badan Pusat Statistik Provinsi Riau, Pekanbaru, hlm. 1–11, 1 Maret 2024. Diakses: 3 November 2024. [Daring]. Tersedia pada: https://pekanbarukota.bps.go.id/id/pressrelease/2024/03/01/880/perkembangan-pariwisata-provinsi-riau-januari-2024.html
  2. Sonica dan F. Lubis, “Analisis Tingkat Pelayanan Jalan Riau Kota Pekanbaru,” Jurnal Teknik, vol. 1, no. 2, hlm. 90–97, Okt 2017.
  3. B. Ardi Isnanto, “Data Terbaru 10 Provinsi di RI dengan Jalan Rusak Terbanyak,” detik.com. Diakses: 4 November 2024. [Daring]. Tersedia pada: https://finance.detik.com/infrastruktur/d-7340690/data-terbaru-10-provinsi-di-ri-dengan-jalan-rusak-terbanya
  4. A. Rahma Amin, M. Ikhsan, dan L. Wibisono, “Traveling Salesman Problem.” Diakses: 3 November 2024. [Daring]. Tersedia pada: https://informatika.stei.itb.ac.id/~rinaldi.munir/Stmik/Makalah/MakalahStmik30.pdf
  5. I. Alifiani, M. Aznar Abdillah, dan I. Saliha, “Solusi Optimal Pencarian Jalur Tercepat Menggunakan Algoritma Dijkstra Untuk Mencari Lokasi Cafe Di Bumiayu,” Jurnal Derivat, vol. 8, no. 2, hlm. 140–148, Des 2021.
  6. N. Awalloedin, W. Gata, dan D. N. Qomariyah, “Algoritma Dijkstra Dalam Penetuan Rute Terpendek Pada Jalan Raya Antar Kota Jakarta-Tangerang,” 2022. [Daring]. Tersedia pada: https://jurnal.umj.ac.id/index.php/just-it/index
  7. N. G. Ginasta dan S. Supriady, “Implementasi Pencarian Rute Terbaik untuk Mengetahui Lokasi Tempat Parkir pada Sistem E-Parking Menggunakan Algoritma Dijkstra dan Best First Search,” MALCOM: Indonesian Journal of Machine Learning and Computer Science, vol. 4, no. 2, hlm. 607–613, Mar 2024, doi: 10.57152/malcom.v4i2.1261.
  8. A. Prawidya, B. Pramono, L. M. Bahtiar Aksara, dan J. T. Informatika, “Travelling Salesman Problem (TSP) Untuk Menentukan Rute Terpendek Bagi Kurir Kota Kendari Menggunakan Algoritma Greedy Berbasis Android,” vol. 3, no. 1, hlm. 95–106.
  9. D. Fallo, “Pencarian Jalur Terpendek Menggunakan Algoritma Ant Colony Optimization,” Jurnal Pendidikan Teknologi Informasi (JUKANTI), no. 1, 2018.
  10. V. Risqiyanti dan A. D. Rizkia, “Pencarian Rute Terpendek Menggunakan Algoritma Ant Colony Optimization Pada Gui Matlab Guna Memantau Sustainable Development Goals Studi Kasus Wilayah Jawa Tengah,” dalam Seminar Nasional Official Statistics, 2019, hlm. 31–38.
  11. D. Udjulawa dan S. Oktarina, “Penerapan Algoritma Ant Colony Optimization Untuk Pencarian Rute Terpendek Lokasi Wisata (Studi Kasus Wisata Di Kota Palembang),” vol. 3, no. 1, 2022.
  12. Y. S. Tyas dan W. Prijodiprodjo, “Aplikasi Pencarian Rute Terbaik dengan Metode Ant Colony Optimazation (ACO),” IJCCS, vol. 7, no. 1, hlm. 55–64, 2013.
  13. O. F. Handi, “Penerapan Algoritma Analytical Hierarchy Process (Ahp) Pada Sistem Pendukung Keputusan Penerima Bantuan Sosial Berbasis Web (Studi Kasus Kantor Kelurahan Gumiwang Lor, Kab. Wonogiri).”
  14. A. Supriadi, A. Rustandi, D. Hastuti Lestari Komarlina, dan G. Tia Ardiani, Analytical Hierarchy Process (AHP) Teknik Penentuan Strategi Daya Saing Kerajinan Bordir. 2018.

Similar Articles

1 2 3 4 > >> 

You may also start an advanced similarity search for this article.