Optimal Distribution Route Planning based on Collaboration of Dijkstra and Sweep Algorithm

Abstract

More than half of company’s logistic budget is spent for the transportation matter. Hence, applying the efficient way to distribute things is exactly needed for the transportation system in order to gain better profit. The combination of Dijkstra algorithm and Sweep Algorithm is a novel method that able to resolve optimal distribution route planning. As we gain from our research that by utilizing this method we achieve the reduction of both distance travel and trip’s time. We are gaining better solution for 9.3% in distance travel and successful cutting time travel for 50% from the original trip’s time.