Random Choice of Logistics Distribution Route Based on Dynamic Programming

Article Preview

Abstract:

It is important for logistics enterprise to choose the best logistics distribution route to improve efficiency. Dynamic programming is analyzed. Traffic jam factor of logistics distribution path is imported in the basic algorithm to modify the path value according to random distribution path condition. An example is used to verify the improved algorithm is practical.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 605-607)

Pages:

2493-2496

Citation:

Online since:

December 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] LANG Mao-xiang,HU Si-ji. Study on the Optimization of Physical Distribution Routing Problem by Using Hybrid Genetic Algorithm [J]. Chinese Journal of Management Science [M].2002.10(51~56) in Chinese.

Google Scholar

[2] WANG Xiao-dong. Algorithm Design and Analysis [M]. Beijing: High Education Press,(2003)

Google Scholar

[3] Thomas H, Cormen, Charles E. Le. Introduction to Algorithms [M], MIT Press, (2005)

Google Scholar

[4] JIANG Qi-wei, CHEN Zhi-ya.On Dynamic Programming Method in the Shortest Route of Logistics Delivery[J],System Engineering, 2007.4(27-29) in Chinese.

Google Scholar

[5] WANG Hong-mei. Algorithm Design and Analysis [M] . Beijing:Tsinghua university Prss,(2006)

Google Scholar