The Research of Vehicle Routing Problem With Time Window for Changsha Yunda Express in Kaifu District

Article Preview

Abstract:

For express companies' distribution center, optimizing the vehicle routing can improve service levels and reduce logistics costs. This paper combines the present vehicle routing situation of Chang Sha Yunda Express in KaiFu area with the specific circumstances to analyze. A model of the vehicle routing problem with time window for the shortest distance was built and then use genetic algorithm to solve the problem. Its application showed that the method can effectively solve the current vehicle routing problems.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2525-2528

Citation:

Online since:

July 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Jiangdali, Yangxilong, Duwen. A Study on the Genetic Algorithm for Vehicle Routing Problem. Systems Engineering-theory & Practice 1999; 19: 54-60.

Google Scholar

[2] Zoudan, Lining, Sundebao. Genetic Algorithm for Variable Fleet Vehicle Routing Problem with Time Window. Systems Engineering-theory & Practice 2004; 6: 134-138.

Google Scholar

[3] Yuanjianqing. Optimization Algorithm and Reviewed of Vehicle Routing. Software Guide 2011; 7: 60-64.

Google Scholar

[4] Wangyongfeng, Yangyu, Guyongming. Chaotic genetic algorithm for solving vehicle routing problems with time windows. Application Research of Computers 2012; 7: 119-124.

Google Scholar

[5] Huanglan, Pangwei, Wangkangping. New Genetic Algorithm for Vehicle Routing Problem with Time Window. Journal of Chinese Computer System 2005; 26: 108-113.

Google Scholar

[6] Yanqing, Paoyuanlu. New Genetic Algorithm for Vehicle Routing Problem with Time Window. Computer Application 2004; 24: 212-217.

Google Scholar