A Route Optimizing Model and Algorithm for Pickup and Delivery Problem with Time Window

Article Preview

Abstract:

Choosing in the more practical soft time Windows the logistics pickup and delivery path choice is discussed. Setting up a more comprehensive model to get the minimum cost including the distance and time. Then improving the genetic algorithm to solve the vehicle routing optimization problems better.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2060-2064

Citation:

Online since:

June 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Zhiyong Zhang, Weihua Zhou, Yongqing Shi. Logistics distribution vehicle routing optimization problem research based on pickup and delivery in Chinese [J]. Commercial Age, 2010, (12):44-45.

Google Scholar

[2] Mingyao Qi, Guoxiang Ding, You Zhou etc. Vehicle Routing Problem with Time Windows Based on Spatiotemporal Distance in Chinese[J]. Transportation Systems Engineering and Information,2011,11(1):85-89.

DOI: 10.1016/s1570-6672(10)60104-3

Google Scholar

[3] Fanghua Liu, Jianmin Zhao, Huiying Xu etc. A Mergers and Acquisitions Algorithm of Optimizing the Physical Distribution Routing Problem with Time Windows in Chinese [J]. Compute Engineering & Science2010,32(12):80-84.

Google Scholar

[4] Fu Guo , Ying Long, On the Algorithm for VRPBTW in Chinese [J]. Journal of Northeastern University (Natural Science),2006,27 (5):575-578.

Google Scholar

[5] Chuanzhong Yin, Lei Bu, Yun Pu etc. Model and Algorithm for Vehicle Routing Problem with Backhauls and Time Windows in Chinese[J]. JOURNAL OF SOUTHW EST JIAOTONG UN IVERSITY,2006,41(3):290-295.

Google Scholar