Research Article Open Access

Cargo Route Optimization Using Shortest Path Algorithms: Runtime and Validity Comparison

Dedy Rahman Wijaya1, Aqil Athallah1, Tiara Nuha Noor’afina1, Patrick Adolf Telnoni1 and Sari Dewi Budiwati1
  • 1 School of Applied Science, Telkom University, Bandung, Indonesia

Abstract

The Indonesian logistics industry is facing significant challenges related to inefficiency and irregularity, particularly in the commodity cargo route system. This issue is further exacerbated by the high logistics costs in the country, which currently stands at 23%, higher than that of other countries. To address this issue, this study proposes an implementation and examination of several algorithms Greedy, Best First Search (BFS), Dijkstra’s, A*, and Floyd-Warshall to optimize the cargo route system and reduce logistics costs. The algorithms were compared using various parameters, including price, distance, rating, and time. The results revealed that the Greedy algorithm is not a reliable option for cargo route optimization. In contrast, the A* algorithm offered the best solution compared to other algorithms, although it was not the fastest in terms of time. This study emphasizes the importance of considering various factors to optimize the cargo route system effectively. The experiments conducted in this study offer promising insights and pave the way for further research to improve the efficiency and reliability of the logistics industry in Indonesia.

Journal of Computer Science
Volume 19 No. 11, 2023, 1369-1379

DOI: https://doi.org/10.3844/jcssp.2023.1369.1379

Submitted On: 15 May 2023 Published On: 19 October 2023

How to Cite: Wijaya, D. R., Athallah, A., Noor’afina, T. N., Telnoni, P. A. & Budiwati, S. D. (2023). Cargo Route Optimization Using Shortest Path Algorithms: Runtime and Validity Comparison. Journal of Computer Science, 19(11), 1369-1379. https://doi.org/10.3844/jcssp.2023.1369.1379

  • 1,620 Views
  • 1,307 Downloads
  • 0 Citations

Download

Keywords

  • Cargo Route
  • Shortest Path
  • Greedy
  • A*
  • Dijkstra’s
  • Floyd-Warshall
  • Best First Search