Effectiveness of Pickup and Delivery Services in Logistics Companies with Route Optimization using the A* Algorithm

Cahyo Prianto, Nur Tri Ramadhanti Adiningrum

Abstract


Logistics is situated at the epicenter of both production and consumption, its role in the economy is becoming more and more significant. A logistics company is a business that specializes in offering logistics services; an example of such a business in Bandung is a logistics company that offers pickup and delivery services. Of the many locations that will be visited by couriers every day, of course, effective vehicle route management is needed to minimize costs, time, and vehicle efficiency. Therefore, the goal is to find the shortest route from one location to another based on the distance factor. To achieve this goal, the A* algorithm is used using Python as a solution to find the shortest route and Dijkstra as a comparison of route search algorithms. The study's findings demonstrated that the A* algorithm, with a calculation time of 0.0004022 ms, was efficient in finding the shortest path while requiring the least amount of CPU processing at 5.56%. While Dijkstra took 7.29% of the computation and produced a time of 0.033026 ms. A* proved effective in finding the shortest route by producing a distance of 3.11 km. While other routes produced distances of 3.34 km, 4.54 km, and 4.77 km. In addition, the use of a GUI has been successfully implemented as an interactive visualization so that couriers can easily find the shortest route along with the distance traveled. The logistics company can use the A* algorithm and the GUI developed to improve the efficiency of delivery and pickup of goods. By utilizing optimized shortest route searches, companies can save time and increase customer satisfaction through faster and more efficient delivery.

Keywords


A* Algorithm; Effectiveness; Pickup; Delivery; Route Optimization

Full Text:

Link Download

References


Aswandi, & Marlina, L. (2023). Implementation of the A Star Heuristic Search Algorithm in Determining the Shortest Path. International Journal of Computer Sciences and Mathematics Engineering, 2(1). https://doi.org/10.61306/ijecom.v2i1.20

Behún, M., Knežo, D., & Cehlár, M. (2022). Recent Application of Dijkstra’s Algorithm in the Process of Production Planning. Applies Sciences, 12. https://doi.org/10.3390/app12147088

Bismi, W., Gata, W., Anton, & Asra, T. (2021). Penerapan Algoritma Hybrid Dalam Menentukan Rute Terpendek Antara Cabang Kampus. Ultima Computing, 13. https://doi.org/10.31937/sk.v13i1.1856

Boysen. Nils, Fedtke, S., & Schwerdfeger, S. (2020). Last-mile delivery concepts: A survey from an operational research perspective. OR Spectrum, 43. https://doi.org/10.1007/s00291-020-00607-8

Candra, A., Budiman, M. A., & Pohan, R. I. (2021). Application of A-Star Algorithm on Pathfinding Game. Journal of Physics: Conference Series. https://10.0.4.64/1742-6596/1898/1/012047

Cano, J. A., Gómez-Montoya, R. A., Salazar, F., & Cortés, P. (2021). Disruptive and Conventional Technologies for the Support of Logistics Processes: A Literature Review. International Journal of Technology (IJTech), 12(3). https://doi.org/https://doi.org/10.14716/ijtech.v12i3.4280

Dablanc, L., Diziain, D., & Levifve, H. (2011). Urban freight consultations in the Paris region. European Transport Research Review, 3(1). https://etrr.springeropen.com/articles/10.1007/s12544-011-0049-2

Durdu, A., & Kaya, M. F. (2023). The Effects of Route Optimization Software to the Customer Satisfaction. Sakarya University Journal of Science, 27(4). http://dx.doi.org/10.16984/saufenbilder.1259595

Fajri, Effendi, T. R., & Fadillah, N. (2020). Sistem Absensi Berbasis Pengenalan Wajah Secara Real Time menggunakan Metode Fisherface. Jurnal Nasional Informatika Dan Teknologi Jaringan, 4(2). https://doi.org/10.30743/infotekjar.v4i2.2377.

Feng, B., & Ye, Q. (2021). Operations management of smart logistics: A literature review and future research. Frontiers of Engineering Management, 8. https://doi.org/10.1007/s42524-021-0156-2.

Firwanda, A. Y., Prianto, C., & Rahayu, W. I. (2021). Penentuan Rute Terpendek Lokasi Badan Pusat Statistik Kota Bandung Dengan Algoritma Dijkstra. JUTEKIN, 9. http://dx.doi.org/10.51530/jutekin.v9i1.509

Foead, D., Ghifari, A., Kusuma, M. B., Hanafiah, N., & Gunawan, E. (2021). A Systematic Literature Review of A* Pathfinding. Procedia Computer Science, 179, 507–514. https://doi.org/10.1016/j.procs.2021.01.034

Gede Wahyu Antara Dalem, I. B. (2018). Penerapan Algoritma A* (Star) Menggunakan Graph untuk Menghitung Jarak Terpendek. Jurnal Resistor, 1(1), 41–47. https://dx.doi.org/10.31598/jurnalresistor.v1i1.253.

Jiang, L., & Mahmassani, H. S. (2014). City Logistics: Freight Distribution Management with Time-Dependent Travel Times and Disruptive Events. Transportation Research Record: Journal of the Transportation Research Board, 2410(1). https://doi.org/10.3141/2410-10.

Liu, L., Wang, B., & Xu, H. (2022). Research on Path-Planning Algorithm Integrating Optimization A-Star Algorithm and Artificial Potential Field Method. MDPI Electronics, 11(22). https://doi.org/10.3390/electronics11223660.

Marcelina, D., & Yulianti, E. (2020). Aplikasi Pencarian Rute Terpendek Lokasi Kuliner Khas Palembang Menggunakan Algoritma Euclidean Distance dan A*(Star). Jurnal Sistem Informasi Dan Komputer, 9(2). https://doi.org/10.32736/sisfokom.v9i2.827.

Ngo, Q.-H. (2023). The effectiveness of market orientation in the logistic industry: A focus on SMEs in an emerging country. Heliyon, 9(7). https://doi.org/10.1016/j.heliyon.2023.e17666

Palacin, J., Rubies, E., Bitria, R., & Clotet, E. (2023). Path Planning of a Mobile Delivery Robot Operating in a Multi-Story Building Based on a Predefined Navigation Tree. Sensors, 23(21). https://doi.org/10.3390/s23218795.

Pane, S. F., Awangga, R. M., Rahcmadani, E. V., & Permana, S. (2019). Implementasi Algoritma Genetika Untuk Optimalisasi Pelayanan Kependudukan. Jurnal Teknik Insentif, 13(2), 36–43. https://doi.org/10.36787/jti.v13i2.130

Patel, M., & Patel, N. (2019). Exploring Research Methodology: Review Article. International Journal of Research and Review, 6(3). https://www.ijrrjournal.com/IJRR_Vol.6_Issue.3_March2019/IJRR0011.pdf

Pranoto, F. S. D. (2020). Penggunaan Algoritma A-Star untuk Menentukan Rute Tercepat di dalam Kampus Ganesha ITB. Makalah IF2120 Matematika Diskrit.

Sheng, L., Bao, L., & Wu, P. F. (2018). Application of heuristic approaches in the robot path planning and optimization: a review. Electron. Opt. Control, 25, 58–64.

Snyder, H. (2019). Literature review as a research methodology: An overview and guidelines. Journal of Business Research, 104, 333–339. https://doi.org/https://doi.org/10.1016/j.jbusres.2019.07.039

Taherdoost, H. (2021). Data Collection Methods and Tools for Research; A Step-by-Step Guide to Choose Data Collection Technique for Academic and Business Research Projects. International Journal of Academic Research in Management, 10(1), 10–38.

https://elvedit.com/journals/IJARM/wp-content/uploads

Trivaika, E., & Senubekti, M. A. (2022). Perancangan Aplikasi Pengelola Keuangan Pribadi Berbasis Android. Nuansa Informatika Technology and Information Journal, 16(1). https://doi.org/10.25134/nuansa.v16i1.4670

Wayahdi, M. R., Ginting, S. H. N., & Syahputra, D. (2021). Greedy, A-Star, and Dijkstra’s Algorithms in Finding Shortest Path. International Journal of Advances in Data and Information Systems, 2(1). http://dx.doi.org/10.25008/ijadis.v2i1.1206

Winkelhaus, S., & H. Grosse, E. (2019). Systematic Review Towards a New Logistics System. International Journal of Production Research, 58(1). https://doi.org/10.1080/00207543.2019.1612964

Wulandari, I. A., & Sukmasetya, P. (2022). Implementasi Algoritma Dijkstra untuk Menentukan Rute Terpendek Menuju Pelayanan Kesehatan. JISI, 1. http://dx.doi.org/10.24127/jisi.v1i1.1953

Zhu, J., & Zhu, Z. (2023). The space-time evolution and driving mechanism of coordinated development of modern logistics industry and tourism industry. Journal of Cleaner Production. https://doi.org/10.1016/j.jclepro.2023.138620




DOI: http://dx.doi.org/10.35671/telematika.v17i2.2860

Refbacks

  • There are currently no refbacks.


 


Indexed by:

 

Telematika
ISSN: 2442-4528 (online) | ISSN: 1979-925X (print)
Published by : Universitas Amikom Purwokerto
Jl. Let. Jend. POL SUMARTO Watumas, Purwonegoro - Purwokerto, Indonesia


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