Abstract

Tourism in Semarang Regency is very diverse, such as historical building tours, culinary tours, and so on. These tourist sites are not close to each other so sometimes it makes tourists need to consider the choice of roads to get to each location in order to save time and gas. The many choices of roads to tourist destinations sometimes make tourists confused because they want to use the fastest route but don't know which routes should be used to get to tourist sites. This can be overcome by searching for a location with the shortest route to help tourists find the fastest route. By implementing a recommendation system, it can attract tourists to visit. Tourists can determine tourism objects based on location. This research utilizes proximity analysis algorithm with Shortest Path Trace to determine the closest travel route from the location of the application user to the tourist location. The Shortest Path Trace Algorithm used is based on mileage optimization calculations using Dijkstra's Algorithm. The implication of this research is that the application generated from this research can be used by tourists to find and find out the closest tourist location along with the shortest path to the tourist location.

References

  1. I. G. Monda and I. Fachruddin, “Strategi Pengembangan Pariwisata Di Kabupaten Tulungagung,” J. Mediasosian J. Ilmu Sos. dan Adm. Negara, vol. 2, no. 2, pp. 1–15, 2019, doi: 10.30737/mediasosian.v2i2.209.
  2. T. Informatika, F. Teknik, U. Maarif, and H. Latif, “Aplikasi Android Untuk Pencarian Rute Terdekat Mini Market Mengunakan Metode Floyd-Warshall Berbasis Gis,” Ubiquitous Comput. its Appl. J., vol. 2, pp. 51–56, 2019, doi: 10.51804/ucaiaj.v2i1.51-56.
  3. A. N. A. F. Nafiah, “Online Berbasis Android Dengan Menggunakan Metode Dijkstra,” vol. 3, pp. 99–106, 2020.
  4. R. H. Simanjuntak, H. Tolle, and R. K. Dewi, “Pengembangan Aplikasi Mobile Geotagging Fasilitas Tanggap Darurat Bencana Alam Menggunakan Algoritma Polylines sebagai Pencarian Rute Terdekat,” … Inf. dan Ilmu Komput. e …, vol. 3, no. 9, pp. 8964–8971, 2019, [Online]. Available: http://j-ptiik.ub.ac.id/index.php/jptiik/article/view/6315.
  5. M. Astiningrum, D. R. Yunianto, and D. Adittiyaputra, “Pencarian Rute Terdekat Pelaku Usaha Mikro, Kecil dan Menengah di Kabupaten Malang pada Android dengan Menggunakan Metode Floyd Warshall (studi Kasus di Diskominfo Kabupaten Malang),” JIP (Jurnal Inform. Polinema), pp. 45–52, 2019.
  6. P. H. S. Widodo, “Pencarian rute terdekat untuk menentukan lokasi rumah ibadah pura di kabupaten blitar menggunakan algoritma a star,” J. Mhs. Tek. Inform., vol. 2, no. 2, pp. 240–246, 2018.
  7. M. I. Raharjo and I. Susilawati, “Aplikasi Pencarian Rute Terdekat Wisata Kota Yogyakarta Menggunakan Algoritma Dijkstra,” Semin. Multimed. & Artif. Intell., vol. 2, no. November, pp. 158–163, 2019.
  8. 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.
  9. M. Febrianto, “Penerapan Payment Gateway Dan Tracking Barang Pada E-Commerce Toko Dazzle Berbasis Website( API),” Tugas Akhir thesis, Univ. Technol. Yogyakarta., 2020.