Abstract
The optimization problem of vehicle distribution routing could be summarized as vehicle routing problem (VRP). The paper simply introduced logistics distribution VRP, established the corresponding optimization model of distribution routing by Dijkstra's Algorithm and Savings Algorithm based on MATLAB software, and verified the effectiveness of the combinational algorithm in accordance with example analysis. According to the results, Dijkstra's Algorithm and Savings Algorithm could optimize logistics distribution routing, effectively reduce distribution mileage and the number of the distributed vehicles, and thus achieve the goal of improving the distribution efficiency, reducing distribution costs, and relieving traffic pressure.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
