PERANCANGAN APLIKASI REKOMENDASI OBJEK PARIWISATA KOTA PEKANBARU BERBASIS ANDROID MENGGUNAKAN LOCATION BASED SERVICE UNTUK DINAS PARIWISATA KOTA PEKANBARU

Jan Alif Kreshna; Ibnu Surya; Kartina Diah	 Kusuma Wardani; Weslie Weslie

doi:10.33884/jif.v10i01.4666

Authors

Jan Alif Kreshna Politeknik Caltex Riau
Ibnu Surya Politeknik Caltex Riau
Kartina Diah Kusuma Wardani Politeknik Caltex Riau
Weslie Weslie Politeknik Caltex Riau

DOI:

https://doi.org/10.33884/jif.v10i01.4666

Keywords:

android, bellman-ford, location based service, tourist attraction

Abstract

Tourists who visit the city of Pekanbaru not only come from within the country, but also from abroad. To provide services to people inside and outside Pekanbaru City, the Pekanbaru City Tourism Office currently has an official website as a medium to convey information about tourist attractions in Pekanbaru City. On the website, there is already a list of tourist attractions in the city of Pekanbaru. This research will develop applications that can be used by tourists who will visit tourist attractions in Pekanbaru City. Applications developed based on Android will provide recommendations for tourist attractions that are around application users by utilizing the Location Based Service feature. The application will also be equipped with a map and use the BellmanFord algorithm to get the shortest route to that location. It is hoped that the application generated from this research can be used as an alternative media that can be used by the Pekanbaru City Tourism Office in order to provide the best service for people inside and outside Pekanbaru City.

References

I. Mutakhiroh, F. Saptono, N. Hasanah, and R. Wiryadinata, “Pemanfaatan Metode Heuristik Dalam Pencarian Jalur Terpendek Dengan Algoritma Semut dan Algoritma Genetika,” SNATI (Seminar Nas. Apl. Teknol. Informasi) 2007, vol. 2007, no. Snati, pp. B33–B39, 2007.

Y. Yaddarabullah, “Modifikasi Algoritme Bellman-Ford Untuk Pencarian Rute Terpendek Berdasarkan Kondisi Jalan,” J. Teknol. dan Sist. Komput., vol. 7, no. 3, pp. 109–115, 2019, doi: 10.14710/jtsiskom.7.3.2019.109-115.

S. Kahfi, “Rancang Bangun Aplikasi Pencarian Bengkel Sepeda Motor Berdasarkan Lokasi Terdekat Menggunakan Metode Bellman-Ford Berbasis Android.”

N. Farhan, S., Andryana, S., & Hayati, “Implementasi Bellman-Ford dan Floyd-Warshall Dalam Menentukan Jalur Terpendek Menuju Universitas Nasional Berbasis Android,” 2020.

J. K. Setiawan, R., Santoso, R. G., & Tampubolon, “Implementasi Algoritma Bellman-Ford untuk Pencarian Jalur Terpendek Menuju Rumah Sakit di Kota Yogya Berbasis Android.,” 2019.

& P. Hamdi, S., “Analisis Algoritma Dijktra dan Algoritma Bellman-Ford Sebagai Penentuan Jalur Terpendek Menuju Lokasi Kebakaran (Studi Kasus: Kecamatan Praya Kota).”

M. Rofiq and R. F. Uzzy, “Penentuan Jalur Terpendek Menuju Cafe Di Kota Malang Menggunakan Metode Bellman-Ford Dengan Location Based Service Berbasis Android,” J. Ilm. Teknol. Inf. Asia, vol. 8, no. 2, pp. 49–64, 2014.

M. P. Dinanda, A. Muzakir, and ..., “Perbandingan ALgoritma Bellman-ford dengan Algoritma Branch and Bounda dalam pencarian Jalur terdekat,” … Comput. …, pp. 344–352, 2019.

S. Spiekermann, General Aspects of Location-Based Services. In J. Schiller, & A. Voisard, Location-Based Services. San Francisco: Morgan Kaufmann Publishers is an imprint of Elsevier, 2004.

H. Huang, Environment., Supporting Smart Mobile Navigation in a Smart In S. Ahson, & M. Ilyas, Location-Based Services Handbook (Applications Technologies, and Security). 2011.

Surya Wijaya, “Implementasi Algoritma Bellman Ford Pada Aplikasi Pencarian Pengobatan Patah Tulang Kem Kem Terdekat di Kota Medan Berbasis Android,” J. Ris. Komput., vol. 6, no. 1, pp. 30–36, 2019.

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

R. Pramudita and N. Safitri, “Algoritma Bellman-Ford Untuk Menentukan Jalur Tercepat Dalam Sistem Informasi Geografis,” PIKSEL Penelit. Ilmu Komput. Sist. Embed. Log., vol. 6, no. 2, pp. 105–114, 2018, doi: 10.33558/piksel.v6i2.1502.

R. Kumar and M. Kumar, “Exploring Genetic Algorithm for Shortest Path Optimization in Data Networks,” Glob. J. Comput. Sci. Technol., vol. 10, no. 11, pp. 8–12, 2010.

Prima, E. A. A., & Simanjuntak, P. (2021). Aplikasi Chatbot Informasi Lokasi Wisata dan Kuliner Kota Batam. Computer and Science Industrial Engineering (COMASIE), 5(3), 65-74.

D. A. J. Ni Ketut, “Penggunaan Algoritma Floyd Warshall Dalam Masalah Jalur Terpendek Pada Penentuan Tata Letak Parkir,” Semin. Nas. Inform., vol. 1, pp. 75–81, 2014.