A Python-Based Implementation of Dijkstra's Algorithm for Optimal Freight Routing in Weighted Graph Networks (Case Study: Banjarnegara-Semarang)

Jundulloh Mubarok (Universitas Negeri Semarang)
Mulyono Mulyono (Universitas Negeri Semarang)

Journal of Mathematics, Computation and Statistics (JMATHCOS)
Vol. 9 No. 3 (2026): Volume 09 Issue 03 (September 2026)

This study aims to determine the optimal freight route using a Python-based implementation of Dijkstra Algorithm in a weighted graph network, with a case study of Banjarnegara-Semarang. The network is modeled as a directed graph where nodes represent regions and edges represent distances (km). The dataset consists of 19 nodes and 38 edges. Computation is performed using Python (NetworkX) to obtain the shortest path efficiently. The results show that the optimal route is Banjarnegara–Wonosobo-Kendal-Semarang with a total distance of 146.20 km. This approach is faster and more accurate than manual calculations and supports efficient logistics decision-making.