Vehicle Routing Problem with Stochastic Demands and Simultaneous Delivery and Pickup

Article Preview

Abstract:

In this paper vehicle routing problem with stochastic demands and simultaneous delivery and pickup is developed and analyzed, which is an important expansion of classical Vehicle Routing Problem(VRP).An effective algorithm based on Important Sampling is designed to solve the model. The optimal importance sampling distribution function was obtained by making use of the expection constructed by likelihood ratio. Numerical experiments have been conducted and the results indicate that the method can effectively solve this problem.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

810-813

Citation:

Online since:

December 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Astrid S. Kenyon, David P. Morton Stochastic Vehicle Routing with Random Travel Times. Transportation Science. 2003, 37(1): 69–82.

DOI: 10.1287/trsc.37.1.69.12820

Google Scholar

[2] Qiu Yue, Zhou Hong. An importance sampling method with applications to rare event probability, IEEE GSIS 2007, 2007: 1381-1385.

Google Scholar

[3] Christian H. Christiansen, Jens Lysgaard. A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research Letters. 2007, 35: 773 – 781.

DOI: 10.1016/j.orl.2006.12.009

Google Scholar

[4] P T de Boer, DP Kroese, S Mannor, RY Rubinstein. A Tutorial on the Cross-Entropy Method , Annals of Operations Research, 2005: 19-67.

DOI: 10.1007/s10479-005-5724-z

Google Scholar