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

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.