Pencarian Stasiun Kereta Terdekat dengan Algoritma A Star Berbasis Android di Bekasi

Ikhsan Dwikurniawan, Herlawati Herlawati, Robertus Suraji

Abstract

Transportation has become one of the most important needs in daily activities in social life. Advances in information technology that exist today, can be used as a means to improve public services, one of which is in the railway sector. With advances in information technology can make it easier for people to find information quickly and easily. There are several obstacles, namely the lack of information about the nearest station route. This study aims to create an android-based nearest station search application with the shortest route to the destination station using the A STAR Algorithm. The A STAR algorithm is an algorithm that looks for the shortest route to reach the expected destination. In this study Kranji Station, Bekasi Station, East Bekasi Station, Tambun Station, Cibitung Station, Telaga Murni Station, Cikarang Station. With tests carried out from 7 times of testing, it can be ensured that 4 times the A STAR algorithm is successful in the shortest distance, 1 time the results of the A STAR algorithm are the same as Google Maps, and 2 times the A-Star algorithm shows a longer distance than Google Maps.

Keywords

Android; Algoritma A STAR; Stasiun

Full Text:

PDF

References

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.

W. Bismi, W. Gata, A. Anton, and T. Asra, “Penerapan Algoritma Hybrid Dalam Menentukan Rute Terpendek Antara Cabang Kampus,” Ultim. Comput. J. Sist. Komput., vol. 13, no. 1, pp. 1–9, 2021.

M. Irsyad and E. Rasila, “Aplikasi Pencarian Lokasi Gedung dan Ruangan Universitas Islam Negeri Sultan Syarif Kasim Riau pada Platform Android Menggunakan Algoritma A-Star ( A *),” J. CoreIT, vol. 1, no. 2, pp. 90–95, 2015.

M. Yamin and M. B. Talai, “Aplikasi Pencarian Jalur Terpendek Pada Rumah Sakit Umum Bahteramas Menggunakan Algoritma a* (a-Star),” J. Inform., vol. 9, no. 2, pp. 1065–1078, 2015, doi: 10.26555/jifo.v9i2.a2961.

M. A. Arsyad, D. Supriyadi, A. Veronica, L. N. Hidayah, and D. P. Pratiwi, “Penerapan Algoritma A Star Untuk Pencarian Rute Terpendek Puskesmas Rawat Inap Di Banyumas,” Conf. Electr. Eng. Telemat. Ind. Technol. Creat. Media 2019, pp. 74–82, 2019, [Online]. Available: http://conferences.ittelkom-pwt.ac.id/index.php/centive/article/view/91.

Z. Ramadhan, M. Zarlis, S. Efendi, and A. P. U. Siahaan, “Perbandingan Algoritma Prim dan Algoritma Floyd-Warshall dalam Menentukan Lintasan Terpendek (Shortest Path Problem),” J. Ris. Komput., vol. 5, no. 2, pp. 136–139, 2018.

P. Y. Utami, C. Suhery, and I. Ilhamsyah, “Aplikasi Pencarian Rute Terpendek Menggunakan Algoritma Genetika (Studi Kasus: Pencarian Rute Terpendek Untuk Pemadam Kebakaran Di Wilayah Kota Pontianak),” J. Coding Sist. Komput. Univ. Tanjungpura, vol. 02, no. 1, pp. 19–25, 2014.

G. G. Maulana, “Pembelajaran Dasar Algoritma dan Pemrograman Menggunakan El-Goritma Berbasis Web,” J. Tek. Mesin, vol. 6, pp. 69–73, 2017.

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.

S. Susilawati, R. Rizky, S. Setiyowati, and A. G. Pratama, “Penerapan Metode A*Star Pada Pencarian Rute Tercepat Menuju Destinasi Wisata Cagar Budaya Menes Pandeglang,” Geodika J. Kaji. Ilmu dan Pendidik. Geogr., vol. 4, no. 2, pp. 192–199, 2020, doi: 10.29408/geodika.v4i2.2754.

E. Erniyati and M. Mulyati, “Pencarian Jalur Terdekat Menuju Rumah Sakit Di Kota Bogor Dengan Menggunakan Algoritma a*,” Komputasi J. Ilm. Ilmu Komput. dan Mat., vol. 16, no. 1, pp. 245–253, 2019, doi: 10.33751/komputasi.v16i1.1729.

Refbacks

  • There are currently no refbacks.