A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty

IIE Transactions (Institute of Industrial Engineers)

Volumn 40, Issue 5, 2008, Pages 509-523

  Sungur, Ilgaz ^a   Ordóñez, Fernando ^a   Dessouky, Maged ^a  

^a University of Southern California ^*  (United States)

Author keywords

Demand uncertainty; Robust optimization; Vehicle routing

Indexed keywords

OPTIMIZATION; STOCHASTIC MODELS; TRANSPORTATION CHARGES; UNCERTAINTY ANALYSIS;

DEMAND UNCERTAINTY; VEHICLE ROUTING PROBLEM;

VEHICLE ROUTING;

EID: 40749112799     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170701745378     Document Type: Article

References (44)

1. Augerat, P., Belenguer, J., Benavent, E., Corbern, A., Naddef, D. and Rinaldi, G. (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem, Universite Joseph Fourier, Grenoble, France
2. Baldacci, R., Hadjiconstantinou, E. and Mingozzi, A. (2004) An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research, 52:5, pp. 723-738.
3. Ben-Tal, A., Goryashko, A., Guslitzer, E. and Nemirovski, A. (2004) Adjustable robust solutions of uncertain linear programs. Mathematical Programming, 99, pp. 351-376.
4. Ben-Tal, A. and Nemirovski, A. (1998) Robust convex optimization. Mathematics of Operations Research, 23:4, pp. 769-805.
5. Ben-Tal, A. and Nemirovski, A. (1999) Robust solutions to uncertain programs. Operations Research Letters, 25, pp. 1-13.
6. Bertsimas, D. (1988) Probabilistic combinational optimization problems, Ph.D. thesis. Operation Research Center, Massachusetts Institute of Technology, Cambridge, MA
7. Bertsimas, D. (1992) A vehicle routing problem with stochastic demand. Operations Research, 40:3, pp. 574-585.
8. Bertsimas, D., Jaillet, P. and Odoni, A. R. (1990) A priori optimization. Operations Research, 38:6, pp. 1019-1033.
9. Bertsimas, D. and Sim, M. (2003) Robust discrete optimization and network flows. Mathematical Programming, 98:1, pp. 49-71.
10. Bertsimas, D. and Sim, M. (2004) The price of robustness. Operations Research, 52:1, pp. 35-53.
11. Bertsimas, D. and Simchi-Levi, D. (1996) A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Operations Research, 44:2, pp. 286-304.
12. Branke, J., Middendorf, M., Noeth, G. and Dessouky, M. M. (2005) Waiting strategies for dynamic vehicle control. Transportation Science, 39, pp. 298-312.
13. Charikar, M., Khuller, S. and Raghavachari, B. (2001) Algorithms for capacitated vehicle routing. SIAM Journal on Computing, 31:3, pp. 665-682.
14. Daganzo, C. F. (1988) Shipment composition enhancement at a consolidation center. Transportation Research, 22:2, pp. 103-124.
15. Dantzig, G. B. and Ramser, J. H. (1959) The truck dispatching problem. Management Science, 6, pp. 80-91.
16. Desrochers, M. and Laporte, G. (1991) Improvements and extensions to the Miller-Tucker-Zemlin sub-tour elimination constraints. Operations Research Letters, 10, pp. 27-36.
17. Dror, M. (1993) Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution. European Journal of Operational Research, 64, pp. 432-441.
18. Dror, M., Laporte, G. and Trudeau, P. (1989) Vehicle routing with stochastic demands: Properties and solution framework. Transportation Science, 23:3, pp. 166-176.
19. El-Ghaoui, L., Oustry, F. and Lebret, H. (1998) Robust solutions to uncertain semidefinite programs. SIAM Journal on Optimization, 9:1, pp. 33-52.
20. Erera, A., Morales, J. and Savelsbergh, M. W. P. (2007) Robust optimization for empty repositioning problems
21. Fisher, M. (1995) Vehicle routing. Network Routing, Volume 8 of Handbooks in Operations Research and Management Science, pp. 1-33. Elsevier, Amsterdam, The Netherlands
22. Fukasawa, R., Longo, H., Lysgaard, J., De Aragão, M. P., Reis, M., Uchoa, E. and Werneck, F. R. (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming Series A, 106:3, pp. 491-551.
23. Gendreau, M., Laporte, G. and Seguin, R. (1995) An exact algorithm for the vehicle routing problem with stochastic customers and demands. Transportation Science, 29:2, pp. 143-155.
24. Gendreau, M., Laporte, G. and Seguin, R. (1996) Stochastic vehicle routing. European Journal of Operational Research, 88:1, pp. 3-12.
25. Goldfarb, D. and Iyengar, G. (2003) Robust portfolio selection problems. Mathematics of Operations Research, 28:1, pp. 1-38.
26. Jaillet, P. (1987) Stochastic routing problem. Stochastics in Combinatorial Optimization, pp. 178-186. World Scientific Publishing, NJ
27. Jaillet, P. (1988) A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Operations Research, 36:6, pp. 929-936.
28. Jaillet, P. and Odoni, A. (1988) The probabilistic vehicle routing problem. Vehicle Routing: Methods and Studies, pp. 293-318. Elsevier, Amsterdam, The Netherlands
29. Jézéquel, A. (1985) Probabilistic vehicle routing problems, Master's thesis. Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA
30. Laporte, G., Louveaux, F. and Mercure, H. (1989) Models and exact solutions for a class of stochastic location-routing problems. European Journal of Operational Research, 39:1, pp. 71-78.
31. Laporte, G., Louveaux, F. and Mercure, H. (1992) The vehicle routing problem with stochastic travel times. Transportation Science, 26:3, pp. 161-170.
32. Laporte, G. and Osman, I. (1995) Routing problems: A bibliography. Annals of Operations Research, 61, pp. 227-262.
33. Lenstra, J. K. and Kan, A. H.G. Rinnooy (1981) Complexity of vehicle routing and scheduling problems. Networks, 11, pp. 221-227.
34. Lysgaard, J., Letchford, N. A. and Eglese, W. R. (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming, 100, pp. 423-445.
35. Mohaddes Associates, Inc (2006) Gateway cities trucking study, Gateway Cities Council of Governments Southeast Los Angeles County
36. Morales, J. C. (2006) Planning robust freight transportation operations, Ph.D. thesis. Georgia Institute of Technology, Atlanta, GA
37. Ordóñez, F., Sungur, I. and Dessouky, M. M. (2007) A priori performance measures for arc-based formulations of the vehicle routing problem
38. Palmer, K., Dessouky, M. M. and Abdelmaguid, T. (2004) Impacts of management practices and advanced technologies on demand responsive transit systems. Transportation Research, Part A: Policy and Practice, 38, pp. 495-509.
39. Ralphs, T., Kopman, L., Pulleyblank, W. and Trotter, L. (2003) On the capacitated vehicle routing problem. Mathematical Programming, 94:2, pp. 343-359.
40. Secomandi, N. (2001) A rollout policy for the vehicle routing problem with stochastic demands. Operations Research, 49:5, pp. 796-802.
41. Stewart, W. and Golden, B. L. (1983) Stochastic vehicle routing: A comprehensive approach. European Journal of Operational Research, 14, pp. 371-385.
42. Toth, P. and Vigo, D. (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Applied Mathematics, 123, pp. 487-512.
43. Waters, C. D. J. (1989) Vehicle-scheduling problems with uncertainty and omitted customers. Journal of the Operational Research Society, 40:12, pp. 1099-1108.
44. Zhong, H., Hall, R. W. and Dessouky, M. M. (2007) Territory planning and vehicle dispatching. Transportation Science, 41, pp. 74-89.