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

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.