Research on Routing Optimization Problem of Cigarette Logistics Vehicle with Time Window Based on Hybrid Genetic Algorithm

DOI

10.2991/emcs-17.2017.127How to use a DOI?

Keywords

Cigarette distribution; Hybrid genetic algorithm; Routing optimization; Logistics distribution; matlab

Abstract

Vehicle Routing Problem is key step in logistics distribution; excellent distribution strategy helps enterprises in improving service experience and reducing service cost. In logistics distribution system for cigarette, huge demand point amount will always be faced with, and customers will put forward requirements for time quantum of accepting service; this Paper researches cigarette distribution routing optimization problem within this big range. By combining actual demands, establish mathematical model for cigarette logistics routing optimization, and use genetic algorithm to solve this problem; propose genetic algorithm-based hybrid genetic algorithm using hill climbing algorithm for local optimization; carry out Matlab simulating calculation through algorithm case; compared to common genetic algorithms, new hybrid algorithm can increase algorithm convergence speed and also improve globally optimal solution quality of algorithms.

Copyright

© 2017, 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  - Wenbing Fan
AU  - Wen Feng
PY  - 2017/03
DA  - 2017/03
TI  - Research on Routing Optimization Problem of Cigarette Logistics Vehicle with Time Window Based on Hybrid Genetic Algorithm
BT  - Proceedings of the 2017 7th International Conference on Education, Management, Computer and Society (EMCS 2017)
PB  - Atlantis Press
SP  - 658
EP  - 668
SN  - 2352-538X
UR  - https://doi.org/10.2991/emcs-17.2017.127
DO  - 10.2991/emcs-17.2017.127
ID  - Fan2017/03
ER  -