Ant Colony Algorithm Based Vehicle Routing Optimization of Tobacco Distribution

DOI

10.2991/mcae-16.2016.39How to use a DOI?

Keywords

tobacco distribution; routing optimization; ant colony algorithm

Abstract

Tobacco distribution Reducing energy consumption in tobacco logistics distribution process is one of the important measurements for energy saving and emission reduction of tobacco industry. Tobacco distribution vehicle routing optimization problem is essentially a typical NP problem. As a novel swarm intelligence optimization algorithm, Ant Colony Algorithm is adopted to solve the problem in the paper. First, a mathematical description of tobacco vehicle distribution problem is analyzed. And then, the basic principle of ACA is introduced followed by steps for tobacco logistics distribution vehicle routing using ACA. Finally, taking certain distribution network of Zhengzhou city for example, compared to simulated annealing algorithm, simulation experiments are carried out using an A CA procedure which is developed by matlab m-language to solve tobacco optimal distribution. The results show that it is feasible to solve Tobacco optimal distribution problem using ACA.

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  - Qingsheng Shi
AU  - Hongchun Hu
AU  - Ke Lu
PY  - 2016/07
DA  - 2016/07
TI  - Ant Colony Algorithm Based Vehicle Routing Optimization of Tobacco Distribution
BT  - Proceedings of the 2016 International Conference on Mechatronics, Control and Automation Engineering
PB  - Atlantis Press
SP  - 164
EP  - 167
SN  - 2352-5401
UR  - https://doi.org/10.2991/mcae-16.2016.39
DO  - 10.2991/mcae-16.2016.39
ID  - Shi2016/07
ER  -