E-Travel Riau Berbasis Mobile Menggunakan Metode Dijkstra
DOI:
https://doi.org/10.30865/mib.v5i4.3261Keywords:
Travel, Application, Android, Dijkstra's AlgorithmAbstract
Travel is one of the transportation that is often used by study tours or tourism in Riau Province. Travel is not only engaged in ordering but also in the field of delivery of goods. But what often happens to travel is that bookings are still done manually. The ordering process is carried out by telephone, then the admin records the address of the passenger to be picked up and the admin immediately confirms to the driver to pick up the passenger. The purpose of this study is to assist passengers in ordering travel online and drivers can monitor and determine the location of prospective passengers. In this study, an android-based online travel booking application was created using the Dijkstra algorithm. The dijkstra algorithm is an algorithm used to solve the shortest path problem for a directed graph with non-negative edge weights. This algorithm is used by drivers to determine the fastest route in the process of picking up prospective passengers. The advantage of this Dijkstra method is that it can find the closest route from the starting point to the end point by comparing the smallest value between points that will be used as a route that will be passed by the travel driver in order to get to the destination faster. The results of this study are a travel application that makes it easier for users to book travel and makes it easier for drivers to determine the fastest route in picking up passengers
References
S. Sunardi, A. Yudhana, and A. A. Kadim, “Implementasi Algoritma Dijkstra Untuk Analisis Rute Transportasi Umum Transjogja Berbasis Android,†J. Sist. Inf. Bisnis, vol. 9, no. 1, p. 32, 2019, doi: 10.21456/vol9iss1pp32-38.
Chayatul Ichan, “Aplikasi Android Pencarian Mikrolet Kota Surabaya Dengan Menggunakan Algoritma Dijkstra,†Tek. Inform. Fak. Tek., vol. 1, no. 1, pp. 6–8, 2018.
F. P. Juniawan et al., “Shortest Path Determination of the Tourist Destination in Toboali Using Web-Based Dijkstra Algorithm,†J. Teknol. Inf. dan Ilmu Komput., vol. 7, no. 1, pp. 211–218, 2020, doi: 10.25126/jtiik.202071954.
A. Cantona, F. Fauziah, and W. Winarsih, “Implementasi Algoritma Dijkstra Pada Pencarian Rute Terpendek ke Museum di Jakarta,†J. Teknol. dan Manaj. Inform., vol. 6, no. 1, pp. 27–34, 2020, doi: 10.26905/jtmi.v6i1.3837.
D. Lesmana, “Algoritma Dijkstra untuk Menentukan Jalur Tercepat pada Pendistribusian Barang Berbasis Mobile Dijkstra ’ s Algorithm for Determining the Fastest Path for Mobile-Based Goods Distribution,†vol. 08, no. 4, pp. 362–368, 2020, doi: 10.26418/justin.v8i4.42250.
C. Prianto and M. Kusnadi, “Penerapan Algoritma Dijkstra Untuk Menentukan Rute Terbaik Pada Mobile E-Parking Berbasis Sistem Informasi Geografis,†J. Inform. J. Pengemb. IT, vol. 3, no. 3, pp. 329–335, 2018, doi: 10.30591/jpit.v3i3.941.
E. Budihartono, “Penerapan Algoritma Dijkstra Untuk Sistem Pendukung Keputusan Bagi Penentuan Jalur Terpendek Pengiriman Paket Barang Pada Travel,†Senit, pp. 69–78, 2016, [Online]. Available: https://ejournal.poltektegal.ac.id/index.php/prosiding/article/viewFile/360/344.
E. C. Galih and R. A. Krisdiawan, “Implementasi Algoritma Dijkstra Pada Aplikasi Wisata Kuningan Berbasis Android,†Nuansa Inform., vol. 12, no. 1, 2018, doi: 10.25134/nuansa.v12i1.1344.
M. S. Yusuf, H. M. Az-zahra, and D. H. Apriyanti, “Implementasi Algoritma Dijkstra Dalam Menemukan Jarak Terdekat Dari Lokasi Pengguna Ke Tanaman Yang Di Tuju Berbasis Android ( Studi Kasus di Kebun Raya Purwodadi ),†J. Pengemb. Teknol. Inf. dan Ilmu Komput., vol. 1, no. 12, pp. 1779–1781, 2017.
M. T. Ismail, S. Andryana, and A. Gunaryati, “Implementasi Algoritma Dijkstra untuk Pencarian Rute Terpendek Menuju Rumah Sakit pada Aplikasi C-Hos ( Covid-19 Hospital ),†vol. 5, pp. 888–895, 2021, doi: 10.30865/mib.v5i3.3077.
T. D. PUTRI, W. SUGENG, and E. SAFITRI, “Algoritma Dijkstra untuk Penentuan Jarak Tempuh Terpendek Pengantaran Katering Pabrik,†MIND J., vol. 5, no. 2, pp. 108–120, 2021, doi: 10.26760/mindjournal.v5i2.108-120.
F. Fatmawati and J. Munajat, “Implementasi Model Waterfall Pada Sistem Informasi Persediaan Barang Berbasis Web (Studi Kasus: PT.Pamindo Tiga T),†J. Media Inform. Budidarma, vol. 2, no. 2, pp. 1–9, 2018, doi: 10.30865/mib.v2i2.559.
D. S. Purnia, A. Rifai, and S. Rahmatullah, “Penerapan Metode Waterfall dalam Perancangan Sistem Informasi Aplikasi Bantuan Sosial Berbasis Android,†Semin. Nas. Sains dan Teknol. 2019, pp. 1–7, 2019.
I. P. W. Gautama and K. Hermanto, “Penentuan Rute Terpendek dengan Menggunakan Algoritma Dijkstra pada Jalur Bus Sekolah,†J. Mat., vol. 10, no. 2, p. 116, 2020, doi: 10.24843/jmat.2020.v10.i02.p128.
Y. Heriyanto, “Perancangan Sistem Informasi Rental Mobil Berbasis Web Pada PT.APM Rent Car,†J. Intra-Tech, vol. 2, no. 2, pp. 64–77, 2018.
A. Firman, H. F. Wowor, X. Najoan, J. Teknik, E. Fakultas, and T. Unsrat, “Sistem Informasi Perpustakaan Online Berbasis Web,†E-Journal Tek. Elektro Dan Komput., vol. 5, no. 2, pp. 29–36, 2016.
Y. Effendi, “Rancangan Aplikasi Game Edukasi Berbasis Mobile Menggunakan App Inventor,†J. Intra-Tech, vol. 2, no. 1, pp. 39–48, 2018.
Downloads
Published
Issue
Section
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:
- 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.
- 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.
- 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).
