Implementation of Dijkstra Algorithm in Determining the Fastest Route for Goods Delivery

Ubaidillah Irganata Putra Mamba’ul Ulum; Indyah Hartami Santi; Mukh. Taofik Chulkamdi

doi:10.59934/jaiea.v4i2.923

Authors

Ubaidillah Irganata Putra Mamba’ul Ulum Teknik Informatika, Universitas Islam Balitar
Indyah Hartami Santi Teknik Informatika, Universitas Islam Balitar
Mukh. Taofik Chulkamdi Teknik Informatika, Universitas Islam Balitar

DOI:

https://doi.org/10.59934/jaiea.v4i2.923

Keywords:

Dijkstra Algorithm, Fastest Route, Goods Delivery

Abstract

Goods delivery is a critical component in business, especially for logistics industries such as J&T Express Gedog, Blitar, which serves areas in Kecamatan Kepanjen Kidul, Kanigoro, Nglegok, and Garum. During the delivery process, couriers often face difficulties in determining the fastest route, particularly for those who are not familiar with the delivery areas. These challenges often lead to getting lost and prolonged delivery times. This research aims to implement the Dijkstra algorithm to determine the fastest route for goods delivery. The road network is modeled as a weighted graph, where nodes represent delivery locations and edges represent the distances between nodes. The Dijkstra algorithm is then used to process this data and find the fastest route from the starting point to the destination. The testing results show that the algorithm provides the shortest route in 90% of the 10 delivery scenarios tested, with an average distance saving of 8.55%. Therefore, the Dijkstra algorithm proves to be effective in optimizing goods delivery routes, improving time and distance efficiency during the delivery process.

Downloads

Download data is not yet available.

References

N. A. Sudibyo, P. E. Setyawan, and Y. P. S. R. Hidayat, “Implementasi Algoritma Dijkstra dalam Pencarian Rute Terpendek Tempat Wisata di Kabupaten Klaten,” Riemann Res. Math. Math. Educ., vol. 2, no. 1, pp. 1–9, 2020.

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.

K. Hermanto and T. D. Ermayanti, “Analisa Optimasi Rute Transportasi Antar Jemput Siswa Menggunakan Model CGVRP dan Algoritma Dijkstra di SDIT Darus Sunnah,” UJMC (Unisda J. Math. Comput. Sci., vol. 5, no. 2, pp. 19–28, 2019.

E. W. Dijkstra, “A note on two problems in connexion with graphs,” in Edsger Wybe Dijkstra: his life, work, and legacy, 2022, pp. 287–290.

G. Brassard and P. Bratley, Fundamentals of algorithmics. Prentice-Hall, Inc., 1996.

S. Baco, R. Syarifuddin, N. I. B, N. Samsul Alan, and Sulfikri, “Perancangan Aplikasi Objek Wisata Alam Di Kabupaten Maros Menggunakan Karakter 3D Adobe Premiere Pro Dengan Algoritma Dijkstra,” J. Teknol. dan Komput., vol. 2, no. 02, pp. 172–177, 2022, doi: 10.56923/jtek.v2i02.103.

R. Diestel, Graph theory. Springer (print edition); Reinhard Diestel (eBooks), 2024.

H. Syahrizal and M. S. Jailani, “Jenis-jenis penelitian dalam penelitian kuantitatif dan kualitatif,” QOSIM J. Pendidikan, Sos. & Hum., vol. 1, no. 1, pp. 13–23, 2023.

E. Ismantohadi and I. Iryanto, “Penerapan Algoritma Dijkstra Untuk Penentuan Jalur Terbaik Evakuasi Tsunami--Studi Kasus: Kelurahan Sanur Bali,” JTT (Jurnal Teknol. Ter., vol. 4, no. 2, pp. 72–78, 2018.

D. R. Wijaya, A. Athallah, T. N. Noor’afina, P. A. Telnoni, and S. D. Budiwati, “Cargo Route Optimization Using Shortest Path Algorithms: Runtime and Validity Comparison,” J. Comput. Sci., vol. 19, no. 11, pp. 1369–1379, 2023, doi: 10.3844/jcssp.2023.1369.1379.