Pencarian Rute Optimal Dengan Metode Steepest Ascent Hill Climbing Untuk Tempat Wisata Di Bandung Menggunakan Android
DOI:
https://doi.org/10.29408/jit.v4i2.3114Keywords:
Optimal Route, SAHC, Graph, AndroidAbstract
The lack of information on the path to tourist attractions makes tourists confused in choosing the shortest path. To overcome this, this study proposes an optimal route search system with the steepest ascent hill climbing method to find the most optimal route to tourist attractions. The search process for this tourist spot begins by looking for the latitude and longitude distance of each tourist spot along with the distance between tourist attractions using google maps, then the distance is entered into the steepest ascent hill climbing method with the initial stage of determining the number of combinations, where the combination results in the number of derivative trails. Then swap the initial path with the derivative path using graph theory. This process is repeated so that if the initial trajectory is smaller than the descended path, the effective route and route will be displayed on google maps. So based on the system testing conducted, the steepest ascent hill climbing method used as the main method of this research can be implemented in the search for the most effective or fastest route using the undirected graph method for the exchange process between tourist attractionsReferences
N. F. Ariyani, I. Fadhila and A. Munif, "Rekomendasi Rute Kunjungan Tempat Wisata Menggunakan Ontologi dan Algoritma A*," Jurnal Riset dan Konseptual, 2020.
A. B. Prakoso, Y. Ariyanto and A. R. Tri Hayati Ririd, "Optimasi Rute Lokasi Wisata Kota Malang Menggunakan Metode Algoritma Genetika," Jurnal Informatika Polinema, vol. 3, no. 3, pp. 48-52, May 2017.
R. Kurniawati, "Perbandingan Algoritma Dijkstra Dan Algoritma Steepest Ascent Hill Climbing Dalam Menentukan Rute Terpendek (Studi Kasus: Antar Lokasi Objekwisata Di Kabupaten Serdang Bedagai)," 2018.
K. K. Nana, B. Prihandono and E. Noviani, "Penyelesaian Travelling Salesman Problem Menggunakan Metode Simple Hill Climbing," Buletin Ilmiah Math. Stat. dan Terapannya (Bimaster), 2015.
L. A. Zemma, H. and A. Qur'ania, "Penerapan Metode Steepest Ascent Hill Climbing pada Model pencarian Rute Terdekat Fasilitas Pelayanan Darurat Di Kota Bogor Berbasis Android," e-Journal, pp. 1-11, 2017.
Y. A. Adharani, E. Susilowati and E. Purwanto, Penerapan Metode Simple Hill Climbing Search Untuk Pencarian Lokasi Terdekat Sekolah Menengah Atas Muhammadiyah, 2017.
H. Anam, F. S. Hanafi, A. F. Adifia, A. F. Ababil and S. Bukhori, "Penerapan Metode Steepest Ascent Hill Climb pada Permainan Puzzle," Informatics Journal, vol. 3, no. 2, pp. 36-40, 2018.
E. V. Dangkua, V. Gunawan and K. Adi, "Penerapan Metode Hill Climbing Pada Sistem Informasi Geografis Untuk Mencari Lintasan Terpendek," Sistem Informasi Bisnis, pp. 19-25, March 2015.
E. Darnila, R. and N. , "Aplikasi Pencarian Rute Terdekat Lokasi Klinik Kesehatan Menggunakan Algoritma Steepest Ascent Hill Climbing," Techsi e-Journal, vol. 11, no. 2, pp. 268-279, July 2019.
I. Fadhillah, Y. Permanasari and E. Harahap, "Representasi Matriks untuk Proses Crossover Pada Algoritma Genetika untuk Optimasi Travelling Salesman Problem," Matematika, pp. 1-10, 2017.
V. Y. I. Ilmaru, T. Sumah, Y. A. Lesnussa and Z. A. Leleury, "Perbandingan Algoritma Hill Climbing Dan Algoritma Ant Colony Dalam Penentuan Rute Optimum," Jurnal Ilmu Matematika dan Terapan, vol. 11, no. 2, pp. 139-150, December 2017.
M. Irfan, "Penyelesaian Travelling Salesman Problem (TSP) Menggunakan Algoritma Hill Climbing dan MATLAB," Matematika, vol. 16, no. 2, pp. 13-20, December 2017.
W. Uriawan, A. Faroqi and R. Fathonah, "Pembuatan Game Slider Puzzle Menggunakan Metode Steepest Ascent Hill Climbing Berbasis Android," ISTEK, vol. 9, no. 1, pp. 204-221, June 2015.
Miftahurrahmah, "Aplikasi Teori Graf Dalam Pengaturan Lampu Lalu Lintas," 2016.
A. Sudianto and H. Ahmadi, “Rancang Bangun Sistem Informasi Penjualan Sparepart Motor Pada Bengkel Vinensi Motor Berbasis Web Guna Meningkatkan Penjualan dan Promosi Produk Pendahuluan Vinensi sepeda motor motor merupakan yang toko cukup kebutuhan suku cadang motor juga dibutuhkan s,†Infotek J. Inform. dan Teknol., vol. 3, no. 2, pp. 32–39, 2020.
Downloads
Additional Files
Published
How to Cite
Issue
Section
License
Semua tulisan pada jurnal ini menjadi tanggung jawab penuh penulis. Jurnal Infotek memberikan akses terbuka terhadap siapapun agar informasi dan temuan pada artikel tersebut bermanfaat bagi semua orang. Jurnal Infotek ini dapat diakses dan diunduh secara gratis, tanpa dipungut biaya sesuai dengan lisense creative commons yang digunakan.
Jurnal Infotek is licensed under a Creative Commons Attribution 4.0 International License.
Statistik Pengunjung
