Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands

Transportation Research Part C: Emerging Technologies

Volumn 19, Issue 5, 2011, Pages 751-765

  Juan, A ^a   Faulin, J ^b   Grasman, S ^c   Riera, D ^a   Marull, J ^a   Mendez, C ^d  

^a UNIVERSITAT OBERTA DE CATALUNYA   (Spain)

^b PUBLIC UNIVERSITY OF NAVARRE   (Spain)

^c MISSOURI UNIVERSITY OF SCIENCE AND TECHNOLOGY   (United States)

^d UNIVERSIDAD NACIONAL DEL LITORAL   (Argentina)

Author keywords

Hybrid algorithms; Metaheuristics; Monte Carlo simulation; Reliability indices; Vehicle routing problem with stochastic demands

Indexed keywords

COST BENEFIT ANALYSIS; COST ESTIMATING; HEURISTIC ALGORITHMS; STOCHASTIC SYSTEMS; UNCERTAINTY ANALYSIS; VEHICLE ROUTING; VEHICLES;

CAPACITATED VEHICLE ROUTING PROBLEM; HYBRID ALGORITHMS; META HEURISTICS; NUMERICAL EXPERIMENTS; RELIABILITY INDEX; SOLUTION METHODOLOGY; STOCHASTIC DEMAND; VEHICLE ROUTING PROBLEMS;

MONTE CARLO METHODS;

ALGORITHM; COMPUTER SIMULATION; HEURISTICS; MONTE CARLO ANALYSIS; ROUTING; STOCHASTICITY; TRANSPORT VEHICLE; TRANSPORTATION PLANNING; TRANSPORTATION SAFETY; NUMERICAL MODEL; TRANSPORTATION DEVELOPMENT;

EID: 79955957973     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2010.09.007     Document Type: Article

References (56)

1. Balaprakash P., Birattari M., Stützle T., Dorigo M. Estimation-based metaheuristics for the probabilistic travelling salesman problem. Computers and Operations Research 2010, 37:1939-1951.
2. Bastian C., Rinnooy Kan A. The stochastic vehicle routing problem revisited. European Journal of Operational Research 1992, 56:407-412.
3. Bent R., Van Hentenryck P. Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Operations Research 2004, 52(6):1526-1563.
4. Bent, R., Van Hentenryck, P., 2007. Waiting and relocation strategies in online stochastic vehicle routing. In: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, Hyderabad, India, pp. 1816-1821.
5. Bertsimas, D., 1988. Probabilistic combinatorial optimization problems. PhD thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
6. Bertsimas D. A vehicle routing problem with stochastic demand. Operations Research 1992, 40:574-585.
7. Bertsimas D., Howell L. Further results on the probabilistic traveling salesman problem. European Journal of Operational Research 1993, 65:68-95.
8. Bertsimas D., Simchi-Levi D. A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Operations Research 1996, 44(2):216-304.
9. Bertsimas D., Jaillet P., Odoni A. A priori optimization. Operations Research 1990, 38:1019-1033.
10. Bianchi L., Birattari M., Chiarandini M., Manfrin M., Mastrolilli M., Paquete L., Rossi-Doria O., Schiavinotto T. Hybrid metaheuristics for the vehicle routing problem with stochastic demands. Journal of Mathematical Modelling and Algorithms 2006, 5:91-110.
11. Bianchi L., Dorigo M., Gambardella L.M., Gutjahr W.J. A survey on metaheuristics for stochastic combinatorial optimization. Natural Computing: an International Journal 2009, 8(2):239-287.
12. Campbell A., Thomas B. Challenges and advances in a priori routing. The Vehicle Routing Problem: Latest Advances and New Challenges 2008, Springer. B. Golden, S. Raghavan, E. Wasil (Eds.).
13. Chepuri K., Homem de Mello H. Solving the vehicle routing with stochastic demands using the cross entropy method. Annals of Operations Research 2005, 134:153-181.
14. Clarke G., Wright J. Scheduling of vehicles from a central depot to a number of delivering points. Operations Research 1964, 12:568-581.
15. Cordeau, F., Laporte, G., Saverlsbergh, M., Vigo, D., 2007. Vehicle routing. In: Barnhart, C., Laporte, G. (Eds.), Handbook in OR&MS, vol. 14, pp. 367-428.
16. Dror M., Trudeau P. Stochastic vehicle routing with modified savings algorithm. European Journal of Operational Research 1986, 23:228-235.
17. Dror M., Laporte G., Trudeau P. Vehicle routing with stochastic demands: properties and solution frameworks. Transportation Science 1989, 23:166-176.
18. Eksioglu B., Volkan A., Reisman A. The vehicle routing problem: a taxonomic review. Computers & Industrial Engineering 2009, 57(4):1472-1483.
19. Feo T.A., Resende M.G. Greedy randomized adaptive search procedures. Journal of Global Optimization 1995, 6:109-133.
20. Gendreau M., Laporte G., Séguin R. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Science 1995, 29(2):143-155.
21. Gendreau M., Laporte G., Séguin R. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research 1996, 44(3):469-477.
22. Gendreau M., Laporte G., Séguin R. Stochastic vehicle routing. European Journal of Operational Research 1996, 88:3-12.
23. Golden, B., Stewart, W.R., 1978. Vehicle routing with probabilistic demands. In: Hogben, D., Fife, D. (Eds.), Computer Science and Statistics: Tenth Annual Symposium on the Interface. NBS Special Publication 503, pp. 252-259.
24. The vehicle routing problem: latest advances and new challenges 2008, Springer, New York. B. Golden, S. Raghavan, E. Wasil (Eds.).
25. Hadjiconstantinou E., Roberts D. Routing under uncertainty: an application in the scheduling of field service engineers. The Vehicle Routing Problem 2002, 331-352. SIAM Publishers, Philadelphia. P. Toth, D. Vigo (Eds.).
26. Hemmelmayr V., Doerner K.F., Hartl R.F., Savelsbergh M.W.P. Vendor managed inventory for environments with stochastic product usage. European Journal of Operational Research 2010, 202:686-695.
27. Hjorring C., Holt J. New optimality cuts for a single-vehicle stochastic routing problem. Annals of Operations Research 1999, 86:569-585.
28. Jaillet, P., 1985. Probabilistic traveling salesman problem. PhD thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
29. Jaillet P. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operations Research 1988, 36:929-936.
30. Jaillet P., Odoni A. The probabilistic vehicle routing problem. Vehicle Routing: Methods and Studies 1988, North-Holland, Amsterdam. B.L. Golden, A.A. Assad (Eds.).
31. Jézéquel, A., 1985. Probabilistic vehicle routing problems. MSc dissertation. Department of Civil Engineering. Massachusetts Institute of Technology, Cambridge, MA.
32. Juan A., Faulin J., Ruiz R., Barrios B., Caballe S. The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem. Applied Soft Computing 2009, 10:215-224.
33. Juan A., Faulin J., Ruiz R., Barrios B., Gilibert M., Vilajosana X. Using oriented random search to provide a set of alternative solutions to the capacitated vehicle routing problem. Operations Research and Cyber-Infrastructure. OR/CS Interfaces Series 47 2009, 331-346. Springer, New York, USA. J. Chinneck, B. Kristjansson, M. Saltzman (Eds.).
34. Juan, A., Faulin, J., Jorba, J., Riera, D., Masip, D., Barrios, B., 2010. On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics. Journal of the Operational Research Society. doi:10.1057/jors.2010.29.
35. Laporte G. What you should know about the Vehicle Routing Problem. Naval Research Logistics 2007, 54:811-819.
36. Laporte G., Louveaux F. The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters 1993, 13:133-142.
37. Laporte G., Louveaux F., Mercure H. Models and exact solutions for a class of stochastic location-routing problems. European Journal of Operational Research 1989, 39:71-78.
38. Laporte G., Louveaux F., Van Hamme L. An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Operations Research 2002, 50:415-423.
39. Markovic, H., Cavar, I., Caric, T., 2005. Using data mining to forecast uncertain demands in Stochastic Vehicle Routing Problem. In: Presented at 13th International Symposium on Electronics in Transport (ISEP), Slovenia.
40. Mendoza J.E., Castanier B., Guéret C., Medaglia A.L., Velasco N. A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Computers and Operations Research 2010, 37:1886-1898.
41. Novoa C., Storer R. An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. European Journal of Operational Research 2009, 196:509-515.
42. Psaraftis H. Dynamic vehicle routing: status and prospects. Annals of Operations Research 1995, 61:143-164.
43. Rei W., Gendreau M., Soriano P. A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands. Transportation Science 2010, 44(1):136-146.
44. Secomandi N. A rollout policy for the vehicle routing problem with stochastic demands. Operations Research 2001, 49(5):796-802.
45. Secomandi N. Analysis of a rollout approach to sequencing problems with stochastic routing applications. Journal of Heuristics 2003, 9(4):321-352.
46. Secomandi N., Margot F. Reoptimization approaches for the vehicle-routing problem with stochastic demands. Operations Research 2009, 57(1):214-230.
47. Séguin, R., 1994. Problèmes stochastiques de tournées de véhicules. PhD thesis, Département d'informatique et de recherche opérationnelle, Université de Montréal, Canada.
48. Shen Z., Ordoñez F., Dessouky M.M. A two-stage vehicle routing model for large-scale bioterrorism emergencies. Networks 2009, 54:255-269.
49. Stewart W., Golden B. Stochastic vehicle routing: a comprehensive approach. European Journal of Operational Research 1983, 14:371-385.
50. Sungur I., Ordóñez F., Dessourky M. A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Transactions 2008, 40:509-523.
51. Tan K., Cheong C., Goh C. Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. European Journal of Operational Research 2007, 177:813-839.
52. Teodorovic D., Pavkovic G. A simulated annealing technique approach to the VRP in the case of stochastic demand. Transportation Planning and Technology 1992, 16:261-273.
53. Tillman F. The multiple terminal delivery problem with probabilistic demands. Transportation Science 1969, 3:192-204.
54. Van Hentenryck P., Bent R. Online Stochastic Combinatorial Optimization 2010, The MIT Press, Boston, USA.
55. Verweij B., Ahmed S., Kleywegt A.J., Nemhauser G.L., Shapiro A. The sample average approximation method applied to stochastic routing problems: a computational study. Computational Optimization and Applications 2003, 24:289-333.
56. Yang W., Mathur K., Ballou R. Stochastic vehicle routing problem with restocking. Transportation Science 2000, 34:99-112.