Applying simulation and reliability to Vehicle Routing Problems with Stochastic Demands

CEUR Workshop Proceedings

Volumn 589, Issue , 2009, Pages

  Juan, Angel A ^a   Grasman, Scott E ^b   Faulin, Javier ^c   Riera, Daniel ^a   Méndez, Carlos A ^d   Ruiz, Bernardo ^a  

^a UNIVERSITAT OBERTA DE CATALUNYA   (Spain)

^b University of Missouri Rolla   (United States)

^c PUBLIC UNIVERSITY OF NAVARRE   (Spain)

^d UNIVERSIDAD NACIONAL DEL LITORAL   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; FLEET OPERATIONS; MONTE CARLO METHODS; NETWORK ROUTING; OPERATIONS RESEARCH; ROUTING ALGORITHMS; STOCHASTIC CONTROL SYSTEMS;

ALTERNATIVE SOLUTIONS; FLEET OF VEHICLES; RELIABILITY INDEX; ROUTE FAILURE; SET OF CUSTOMERS; STOCHASTIC DEMAND; VEHICLE CAPACITY; VEHICLE ROUTING PROBLEMS;

PROBLEM SOLVING;

EID: 84888221292     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. D. Bertsimas. Probabilistic combinatorial optimization problems. PhD thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA, 1988.
2. D. Bertsimas. A vehicle routing problem with stochastic demand. Operations Research, 40:574-585, 1992.
3. D. Bertsimas, P. Jaillet, and A. Odoni. A priori optimization. Operations Research, 38:1019-1033, 1990.
4. D. Bertsimas and D. Simchi-Levi. A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Operations Research, 44(2):216-304, 1996.
5. A. Campbell and B. Thomas. Challenges and Advances in a priori Routing. Springer, 2008.
6. K. Chepuri and H. Homem de Mello. Solving the vehicle routing with stochastic demands using the cross entropy method. Annals of Operations Research, 135:153-181, 2005.
7. G. Clarke and J. Wright. Scheduling of vehicles from a central depot to a number of delivering points. Operations Research, 12:568-581, 1964.
8. M. Dessouky, F. Ordonez, H. Jia, and Z. Shen. Rapid distribution of medical supplies, pages 309-339. Patient flow: Reducing delay management in health care systems. Springer, USA, 2005.
9. R. Dondo, C. Mendez, and J. Cerda. An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints. Latin American Applied Research, 33:129-134, 2003.
10. M. Dror, G. Laporte, and P. Trudeau. Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Science, 23:166-176, 1989.
11. M. Dror and P. Trudeau. Stochastic vehicle routing with modified savings algorithm. European Journal of Operational Research, 23:228235, 1986.
12. B. Eksioglu, A. Volkan, and A. Reisman. The vehicle routing problem: A taxonomic review. Computers & Industrial Engineering, 2009.
13. M. Gendreau, G. Laporte, and R. Seguin. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Science, 29(2):143-155, 1995.
14. B. Golden and W. Stewart. Vehicle routing with probabilistic demands. In D. Hogben and D. Fife, editors, Computer Science and Statistics: Tenth Annual Symposium on the Interface. NBS Special Publication, volume 503, pages 252-259, Slovenia, 1978.
15. S. Golden, B.; Raghavan and E. Wasil, editors. The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York, 2008.
16. P. Jaillet. Probabilistic traveling salesman problem. PhD thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA, 1985.
17. P. Jaillet. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operations Research, 36:929-936, 2002.
18. P. Jaillet and A. Odoni. The probabilistic vehicle routing problem. North-Holland, Amsterdam, 1988.
19. A. Juan, J. Faulin, R. Ruiz, B. Barrios, and S. Caballe. The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem. Applied Soft Computing, 2009.
20. G. Laporte. What you should know about the vehicle routing problem. Naval Research Logistics, 54:811-819, 2007.
21. H. Markovic, I. Cavar, and T. Caric. Using data mining to forecast uncertain demands in stochastic vehicle routing problem. In Proceedings of the 13th International Symposium on Electronics in Transport (ISEP), Slovenia, 2005.
22. C. Novoa and R. Storer. An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. European Journal of Operational Research, 196:509-515, 2009.
23. N. Secomandi. A rollout policy for the vehicle routing problem with stochastic demands. Operations Research, 49(5):796-802, 2001.
24. N. Secomandi. Analysis of a rollout approach to sequencing problems with stochastic routing applications. Journal of Heuristics, 9(4):321-352, 2003.
25. K. Tan, C. Cheong, and C. Goh. Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. European Journal of Operational Research, 177:813-839, 2007.
26. F. Tillman. The multiple terminal delivery problem with probabilistic demands. Transportation Science, 3:192-204, 1969.
27. W. Yang, K. Mathur, and R. Ballou. Stochastic vehicle routing problem with restocking. Transportation Science, 34(1):99-112, 2000.