Article Sidebar

Download
PDF

Main Article Content

Abstract

Courier services are a service that facilitates the delivery of various types of goods between locations with security guaranteed by the service provider. Goods delivery encompasses logistics, products, and documents. The growth of the courier service industry, reflected in the increasing trust of the public, demonstrates the importance of timely delivery in the business. Timeliness is a key factor in the courier business, however, couriers often face difficulties in locating recipients and experience delays due to difficulties in finding the nearest routes. Therefore, finding the nearest route is crucial to expedite delivery. The Dijkstra Algorithm is one method used to find the nearest route by calculating the shortest distance between two points in a graph, by calculating the optimal path. Calculation results using the Dijkstra Algorithm indicate that the shortest route is A-F-G-H-I-J-B-C-D-E-K-L-M-N-O with a path length of 11039 meters. Black-Box testing on Android-based applications shows a testing rate of 100%, validating the accuracy of the application in determining routes with precise results.


Keywords: Shipping, Nearest Route, Dijkstra Algorithm

Keywords

Shipping, Nearest Route, Dijkstra Algorithm

Article Details

License

Copyright (c) 2025 Muhammad Sholahuddin, Agus Supriatman, Teguh Ikhlas Ramadhan

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 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 a Creative Commons Attribution 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 (See The Effect of Open Access).
  4. This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
How to Cite
Muhammad Sholahuddin, Agus Supriatman, & Teguh Ikhlas Ramadhan. (2025). Implementasi Algoritma Dijkstra Penentuan Rute Terdekat Untuk Pengiriman Barang Berbasis Android. JURNAL AMPLIFIER : JURNAL ILMIAH BIDANG TEKNIK ELEKTRO DAN KOMPUTER, 15(1), 1–8. https://doi.org/10.33369/jamplifier.v15i1.33813
Download Citation
Endnote/Zotero/Mendeley (RIS)
BibTeX

References

  1. P. Ibrahim and P. Astuti, “Perancangan Sistem Informasi Pengiriman Barang Berbasis Web Pada pt . Boma Tirta Prima Reputasi : Jurnal Rekayasa Perangkat Lunak,” vol. 2, no. 1, pp. 31–36, 2021.
  2. A. N. A. F. Nafiah, “Perancangan Aplikasi Pencarian Rute Terdekat Jasa Binatu Online Berbasis Android Dengan Menggunakan Metode Dijkstra,” Ubiquitous Comput. its Appl. J., vol. 3, pp. 99–106, 2020, doi: 10.51804/ucaiaj.v3i2.99-106.
  3. M. Masri, A. P. Kiswanto, and B. S. Kusuma, “Implementasi Algoritma Dijkstra Dalam Perancangan Pariwisata Danau Toba Dan Sekitarnya,” Semin. Nas. Tek. UISU, pp. 221–225, 2019.
  4. E. S. Arga, G. G. Firmansyah, K. Imam, and M. Fauzi, “Penerapan algoritma djikstra pada pencarian jalur terpendek,” vol. 1, no. 2, pp. 134–142, 2021.
  5. R. Umar, A. Yudhana, and A. Prayudi, “Perbandingan, Analisis Djikstra, Algoritma Warshall, Floyd Pencarian, Dalam Terdekat Pada Objek Wisata Kabupaten Dompu,” J. Teknol. Inf. dan Ilmu Komput., vol. 8, no. 2, pp. 227–234, 2021, doi: 10.25126/jtiik.202182866.
  6. C. V. Esanata, “Penerapan Metode Djikstra Sebagai Penentuan Rute Terpendek Distribusi Pengiriman Kantor Jne Pusat Kabupaten Jombang,” J. Mhs. Tek. Inform., vol. 3, no. 1, pp. 1–43, 2019, [Online]. Available: https://ejournal.itn.ac.id/index.php/jati/article/download/582/550.
  7. M. Napiah, R. D. Astuti, and M. Mustofa, “Implementasi Algoritma Djikstra Menentukan Jarak Terdekat Jelambar Kampus Stmik Nusa Mandiri Cengkareng,” Akrab Juara J. Ilmu-ilmu Sos., vol. 7, no. 1, p. 80, 2022, doi: 10.58487/akrabjuara.v7i1.1757.
  8. H. Paunsyah, H. Mubarok, and R. N. Shofa, “Penentuan Jalur Terpendek Menggunakan Google Maps API pada Sistem Informasi Geografis ( GIS ) Panti Sosial di Kota Tasikmalaya,” vol. 1, pp. 1–6, 2019.
  9. M. N. Parapat et al., “Rancang Bangun Aplikasi Pencarian Rute Terpendek Jasa Kiriman Barang Berbasis Mobile Dengan Metode Algoritma Dijkstra,” pp. 15–19, 2020.
  10. B. E. G. Pattriskak, R. G. Santosa, and A. R. Chrismanto, “Implementasi Algoritma Dijkstra untuk Mencari Rumah Kost Terdekat di Kodya Yogyakarta Berbasis Android,” J. Terap. Teknol. Inf., vol. 4, no. 1, pp. 45–54, 2021, doi: 10.21460/jutei.2020.41.193.
  11. J. Setiawan et al., “Perbelanjaan Di Jakarta Menggunakan Algoritma Dijkstra,” vol. 21, no. 3, pp. 156–165, 2019.
  12. H. Agung, “Sistem Penentuan Jarak Terpendek Berdasarkan Data Coordinate Menggunakan Algoritma Dijkstra Dalam Kasus Pengantaran Barang Se-Jabodetabek,” J. Sisfokom (Sistem Inf. dan Komputer), vol. 8, no. 1, pp. 14–23, 2019, doi: 10.32736/sisfokom.v8i1.587.
  13. M. Syepanda, Z. Zulhalim, and R. Haroen, “Perancangan Aplikasi Pencarian Rute Wisata Kuliner Berbasis Android Menggunakan Algoritma Dijkstra Di Kota Tangerang Selatan,” J. Manajamen Inform. Jayakarta, vol. 1, no. 2, p. 117, 2021, doi: 10.52362/jmijayakarta.v1i2.448.