The Optimization of Logistics Distribution Route Based on Dijkstra's Algorithm and C-W Savings Algorithm

DOI

10.2991/mmebc-16.2016.200How to use a DOI?

Keywords

Dijkstra's Algorithm; C-W Savings Algorithm; Distribution Route Optimization

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.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Dan Ding
AU  - Xin Zou
PY  - 2016/06
DA  - 2016/06
TI  - The Optimization of Logistics Distribution Route Based on Dijkstra's Algorithm and C-W Savings Algorithm
BT  - Proceedings of the 2016 6th International Conference on Machinery, Materials, Environment, Biotechnology and Computer
PB  - Atlantis Press
SP  - 956
EP  - 965
SN  - 2352-5401
UR  - https://doi.org/10.2991/mmebc-16.2016.200
DO  - 10.2991/mmebc-16.2016.200
ID  - Ding2016/06
ER  -