Penerapan Algoritma A-star dan Brute Force pada Aplikasi Jakvel (Jakarta Travel) Berbasis Android

Authors

  • Septi Andryana Universitas Nasional, Jakarta Selatan
  • Andrianingsih Andrianingsih Universitas Nasional, Jakarta Selatan
  • Naif Farhan Universitas Nasional, Jakarta Selatan

DOI:

https://doi.org/10.30865/mib.v5i3.3089

Keywords:

Algorithm A-Star, Tourist, Android, Google Maps, Algorithm Brute Force

Abstract

The city of Jakarta has several main tourist attractions that are interesting to visit. As the Capital of the State of Indonesia, it will certainly be ogled and visited by local and foreign tourists. However, there is limited information, tourists from outside the Jakarta area lack complete information on tourism in the city of Jakarta and the roads that must be taken to tourist sites, due to the number of roads and heavy traffic, this makes it a problem when you want to vacation in the city of Jakarta. Therefore, the author designed an application called Jakvel based on Android, this application provides information and looks for the shortest path to tourist sites for tourists who want to vacation in Jakarta. In this study using the A-star and Brute Force algorithms. The A-star algorithm will be applied to find the shortest path to tourist sites and the brute force algorithm is used to search for words (strings) in selecting tours. With this application, it is hoped that it will make it easier for tourists outside the Jakarta area to find out tourist information and help find the shortest path to locations in the city of Jakarta. After testing of 10 tourist sites to determine the shortest path by comparing the A-star algorithm with Google Maps based on Android, with a 70% success rate in finding the shortest path using the A-star algorithm and the results of string search testing using the Brute Force algorithm have a percentage of 100% accurate

References

D. Marcelina and E. Yulianti, “Aplikasi Pencarian Rute Terpendek Lokasi Kuliner Khas Palembang Menggunakan Algoritma Euclidean Distance Dan a*(Star),†J. Sisfokom (Sistem Inf. dan Komputer), vol. 9, no. 2, p. 195, 2020, doi: 10.32736/sisfokom.v9i2.827.

M. Mukhlis, M. Orisa, and F. . Ariwibisono, “Penerapan Algoritma a* Untuk Mencari Jarak Terdekat Tempat Wisat Kota Malang Raya,†JATI (Jurnal Mhs. Tek. Inform., vol. 4, no. 1, pp. 349–355, 2020, doi: 10.36040/jati.v4i1.2316.

B. Pratama and A. T. Priandika, “Sistem Informasi Location Based Service Sentra Keripik Kota Bandar Lampung Berbasis Android,†J. Teknol. dan Sist. Inf., vol. 1, no. 1, pp. 81–89, 2020, [Online]. Available: http://jim.teknokrat.ac.id/index.php/sisteminformasi/article/view/237.

V. Budiman, Y. S. H. Lesmono, and H. Agung, “Aplikasi Berbasis Android Untuk Mencari Lokasi Puskesmas Terdekat Dengan Algoritma a-Star Di Provinsi Dki Jakarta,†J. Sist. Informasi, Teknol. Inform. dan Komput., vol. Vol.9, no. No.1, pp. 39–48, 2018.

Y. Fernando, M. A. Mustaqov, and D. A. Megawaty, “Penerapan Algoritma a-Star Pada Aplikasi Pencarian Lokasi Fotografi Di Bandar Lampung Berbasis Android,†J. Teknoinfo, vol. 14, no. 1, p. 27, 2020, doi: 10.33365/jti.v14i1.509.

S. Purnama, D. A. Megawaty, and Y. Fernando, “Penerapan Algoritma A Star Untuk Penentuan Jarak Terdekat Wisata Kuliner di Kota Bandarlampung,†J. Teknoinfo, vol. 12, no. 1, p. 28, 2018, doi: 10.33365/jti.v12i1.37.

R. Rizky, T. Hidayat, A. H. Nugroho, and Z. Hakim, “Implementasi Metode A*Star Pada Pencarian Rute Terdekat Menuju Tempat Kuliner di Menes Pandeglang Banten,†Geodika J. Kaji. Ilmu dan Pendidik. Geogr., vol. 4, no. 1, pp. 85–94, 2020, doi: 10.29408/geodika.v4i1.2068.

Erniyati and Mulyati, “Di Kota Bogor Dengan Menggunakan Algoritma a *,†Komputasi vol. 16, no. 1, pp. 245–253, 2019.

A. Hermawan and A. S. Tiwa, “Penerapan Algoritma A-Star untuk Pencarian Tempat Kuliner di Kota Tangerang,†pp. 104–114, 2021, doi: 10.30864/jsi.v15i2.335.

R. Umar, A. Yudhana, and A. Prayudi, “Analisis Perbandingan Algoritma Djikstra, A-Star, dan Floyd Warshall dalam Pencarian Rute Terdekat pada Objek Wisata Kabupaten Dompu,†J. Teknol. Inf. dan Ilmu Komput., vol. 8, no. 2, p. 227, 2021, doi: 10.25126/jtiik.0812866.

I. B. Gede Wahyu Antara Dalem, “Penerapan Algoritma A* (Star) Menggunakan Graph Untuk Menghitung Jarak Terpendek,†J. Resist. (Rekayasa Sist. Komputer), vol. 1, no. 1, pp. 41–47, 2018, doi: 10.31598/jurnalresistor.v1i1.253.

M. Mayadi and R. Azhar, “Perbandingan Perhitungan Manual Dengan Algoritma a Star Dalam Pencarian Jalur Terpendek Untuk Pengiriman Pesanan Dodol Khas Lombok,†J. Inform. dan Rekayasa Elektron., vol. 2, no. 2, p. 27, 2019, doi: 10.36595/jire.v2i2.114.

W. Alfarisi, “Pencarian Jalur Terpendek Pengirima N Barang Menggunakan Algoritma A* Studi Kasus Kantor POS Besar Medan),†JURIKOM (Jurnal Ris. Komputer), vol. 3, no. 1, pp. 90–95, 2016, [Online]. Available: http://dx.doi.org/10.30865/jurikom.v3i1.58.

A. P. U. Siahaan, “Implementation of A-Star Algorithm in Determining the Shortest Path on Graph,†pp. 374–378, 2018, doi: 10.31227/osf.io/vprzu.

C. Irawan and M. R. Pratama, “Perbandingan Algoritma Boyer-Moore dan Brute Force pada Pencarian Kamus Besar Bahasa Indonesia Berbasis Android,†BIOS J. Teknol. Inf. dan Rekayasa Komput., vol. 1, no. 2, pp. 54–60, 2021, doi: 10.37148/bios.v1i2.13.

R. Rismayani, N. Sambo Layuk, S. Wahyuni, H. Wali, and N. K. Marselina, “Pencarian Kata Pada Aplikasi Kamus Istilah Komputer dan Informatika Menggunakan Algoritma Brute Force Berbasis Android,†Komputika J. Sist. Komput., vol. 10, no. 1, pp. 43–52, 2021, doi: 10.34010/komputika.v10i1.3644.

B. W. Santoso, F. Sundawa, and M. Azhari, “Implementasi Algoritma Brute Force Sebagai Mesin Pencari ( Search Engine ) Berbasis Web Pada Database,†J. Sisfotek Glob., vol. 6, no. 1, pp. 1–8, 2016, [Online]. Available: https://core.ac.uk/download/pdf/288088999.pdf.

Downloads

Published

2021-07-31

Issue

Vol. 5 No. 3 (2021): Juli 2021

Section

Articles

License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. 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 acknowledgment of its initial publication in this journal.
  3. 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 (Refer to The Effect of Open Access).