Optimal Rice Distribution Route Planning Using the Dijkstra Algorithm Approach in Deli Serdang Regency

Rice distribution in Deli Serdang Regency faces challenges in selecting efficient routes to reduce costs, save time, and ensure timely delivery.This study compares the effectiveness of the Dijkstra algorithm in optimising distribution routes.Distance data between distribution points was obtained from Google Maps, while rice demand data was collected from distributors and related institutions.The Dijkstra algorithm was applied to determine the shortest global route, while the Nearest Neighbour algorithm selected routes based on the nearest location at each step (local optimum).The results show that the Dijkstra algorithm reduced the distance travelled from 246.80 km to 156.42 km (a saving of 90.38 km or 36.62%), while the Nearest Neighbour algorithm only reduced it to 226.62 km (a saving of 20.18 km or 8.17%).In conclusion, Dijkstra proved to be more effective in minimising travel distance and improving delivery time.