The robust capacitated vehicle routing problem under demand uncertainty

Operations Research

Volumn 61, Issue 3, 2013, Pages 677-693

  Gounaris, Chrysanthos E ^a   Wiesemann, Wolfram ^b   Floudas, Christodoulos A ^a  

^a Princeton University   (United States)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Probability: chance constraints; Programming: robust optimization; Transportation: vehicle routing

Indexed keywords

CAPACITATED VEHICLE ROUTING PROBLEM; CHANCE CONSTRAINT; CHANCE-CONSTRAINED; CUSTOMER DEMANDS; DELIVERY COSTS; DEMAND UNCERTAINTY; ROBUST OPTIMIZATION; TRANSPORTATION: VEHICLE ROUTING;

NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS; SALES;

COSTS;

EID: 84880049940     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1120.1136     Document Type: Article

References (69)

1. Adelman D (2004) A price-directed approach to stochastic inventory/routing. Oper. Res. 52(4):499-514.
2. Ak A, Erera AL (2007) A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands. Transportation Sci. 41(2):222-237.
3. Augerat P, Belenguer JM, Benavent E, A. Corberán, Naddef D (1998) Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. 106(2-3):546-557. (Pubitemid 128399668)
4. Baldacci R, Hadjiconstantinou E, Mingozzi A (2004) An exact algorithm for the capacitated vehicle routing problem based on a twocommodity network flow formulation. Oper. Res. 52(5):723-738.
5. Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1):1-6.
6. Baldacci R, Toth P, Vigo D (2010) Exact algorithms for routing problems under vehicle capacity constraints. Ann. Oper. Res. 175(1):213-245.
7. Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).
8. Ben-Tal A, Chung BD, Mandala SR, Yao T (2011) Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains. Transportation Res. B 45(8):1177-1189.
9. Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math. Programming Ser. A 99(2):351-376. (Pubitemid 40871727)
10. Bent RW, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. 52(6):977-987. (Pubitemid 40122356)
11. Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math. Programming Ser. B 98(1-3):49-71.
12. Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35-53. (Pubitemid 40000812)
13. Bertsimas D, Simchi-Levi D (1996) A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. 44(2):286-304. (Pubitemid 126669481)
14. Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464-501.
15. Bertsimas D, Iancu DA, Parrilo PA (2010) Optimality of affine policies in multistage robust optimization. Math. Oper. Res. 35(2):363-394.
16. Birge JR, Louveaux F (2011) Introduction to Stochastic Programming, 2nd ed. (Springer, New York).
17. Ceria S, Stubbs RA (2006) Incorporating estimation errors into portfolio selection: Robust portfolio construction. Axioma Research Paper 3, Axioma, Inc., New York.
18. Chen W, Sim M, Sun J, Teo C-P (2010) From CVaR to uncertainty set: Implications in joint chance-constrained optimization. Oper. Res. 58(2):470-485.
19. Chen X, Sim M, Sun P, Zhang J (2008) A linear-decision based approximation approach to stochastic programming. Oper. Res. 56(2):344-357.
20. Christiansen CH, Lysgaard J, Wøhlk S (2009) A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands. Oper. Res. Lett. 37(6):392-398.
21. Cordeau J-F, Laporte G, Savelsbergh MWP, Vigo D (2007) Vehicle routing. Barnhart C, Laporte G, eds. Transportation. Handbooks in Operations Research and Management Science, Vol. 14, Chap. 6 (North-Holland, Amsterdam), 367-428.
22. Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):596-612.
23. Desrochers M, Laporte G (1991) Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 10(1):27-36.
24. Díaz BD (2011) The VRP Web. Accessed May 22, 2011, http://neo.lcc.uma.es/radi-aeb/WebVRP.
25. Dror M, Trudeau P (1986) Stochastic vehicle routing with modified savings algorithm. Eur. J. Oper. Res. 23(2):228-235. (Pubitemid 16477067)
26. Dror M, Laporte G, Louveaux F (1993) Vehicle routing with stochastic demands and restricted failures. Math. Methods Oper. Res. 37(3):273-283.
27. Dror M, Laporte G, Trudeau P (1989) Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. 23(3):166-176.
28. El Ghaoui L, Oks M, Oustry F (2003) Worst-case value-at-risk and robust portfolio optimization: A conic programming approach. Oper. Res. 51(4):543-556.
29. Erera AL, Morales JC, Savelsbergh MWP (2009) Robust optimization for empty repositioning problems. Oper. Res. 57(2):468-483.
30. Erera AL, Morales JC, Savelsbergh MWP (2010) The vehicle routing problem with stochastic demand and duration constraints. Transportation Sci. 44(4):474-492.
31. Gendreau M, Laporte G, Séguin R (1995) An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Sci. 29(2):143-155.
32. Gendreau M, Laporte G, Séguin R (1996) Stochastic vehicle routing. Eur. J. Oper. Res. 88(1):3-12. (Pubitemid 126367087)
33. Golden B, Raghavan S, Wasil E, eds. (2008) The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, New York).
34. Golden BL, Yee JR (1979) A framework for probabilistic vehicle routing. AIIE Trans. 11(2):109-112.
35. Golden BL, Magnanti TL, Nguyen HQ (1977) Implementing vehicle routing algorithms. Networks 7(2):113-148.
36. Gounaris CE, Repoussis PP, Tarantilis CD, Floudas CA (2011) A hybrid branch-and-cut approach for the capacitated vehicle routing problem. Pistikopoulos EN, Georgiadis MC, Kokossis AC, eds. Computer- Aided Chemical Engineering: 21st European Symposium on Computer Aided Process Engineering (Elsevier, Amsterdam), 507-511.
37. Gouveia L (1995) A result on projection for the vehicle routing problem. J. Oper. Res. Soc. 85(3):610-624.
38. Groër C, Golden B, Wasil E (2009) The consistent vehicle routing problem. Manufacturing Service Oper. Management 11(4):630-643.
39. IBM Corporation (2009) ILOG CPLEX Optimization Suite 12. IBM, Armonk, NY.
40. Jaillet P (1988) A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36(6):929-936.
41. Janak SL, Lin X, Floudas CA (2007) A new robust optimization approach for scheduling under uncertainty: II. Uncertainty with known probability distribution. Comput. Chemical Engrg. 31(3):171-195. (Pubitemid 44960432)
42. Kara I, Laporte G, Bektas T (2004) A note on the lifted Miller-Tucker- Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur. J. Oper. Res. 158(3):793-795.
43. Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transportation Sci. 37(1):69-82.
44. Kleywegt AJ, Nori VS, Savelsbergh MWP (2004) Dynamic programming approximations for a stochastic inventory routing problem. Transportation Sci. 38(1):42-70.
45. Kuhn D, Wiesemann W, Georghiou A (2011) Primal and dual linear decision rules in stochastic and robust optimization. Math. Programming Ser. A 130(1):177-209.
46. Kulkarni RV, Bhave PR (1985) Integer programming formulations of vehicle routing problems. Eur. J. Oper. Res. 20(1):58-67. (Pubitemid 15480455)
47. Laporte G (2009) Fifty years of vehicle routing. Transportation Sci. 43(4):408-416.
48. Laporte G, Louveaux F, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transportation Sci. 26(3):161-170.
49. Laporte G, Louveaux F, Van Hamme L (2002) An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 50(3):415-423.
50. Laporte G, Nobert Y, Desrochers M (1985) Optimal routing under capacity and distance restrictions. Oper. Res. 33(5):1050-1073. (Pubitemid 15589837)
51. Li Z, Ding R, Floudas CA (2011) A comparative theoretical and computational study on robust counterpart optimization: I. Robust linear optimization and robust mixed integer linear optimization. Indust. Engrg. Chemical Res. 50(18):10567-10603.
52. Lin X, Janak SL, Floudas CA (2004) A new robust optimization approach for scheduling under uncertainty: I. Bounded uncertainty. Comput. Chemical Engrg. 28(6-7):1069-1085. (Pubitemid 38520960)
53. Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming Ser. A 100(2):423-445. (Pubitemid 40878095)
54. Ordóñez F (2010) Robust vehicle routing. Hasenbein JJ, ed. INFORMS TutORials in Operations Research, Chap. 7 (INFORMS, Hanover MD), 153-178.
55. Prékopa A (1995) Stochastic Programming (Kluwer Academic Publishers, Dordrecht, The Netherlands).
56. Ralphs TK, Kopman L, Pulleyback WR, Trotter LE (2003) On the capacitated vehicle routing problem. Math. Programming Ser. B 94(2-3):343-359.
57. Secomandi N, Margot F (2009) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57(1):214-230.
58. Shapiro A, Dentcheva D, Ruszczyński A (2009) Lectures on Stochastic Programming: Modeling and Theory MPS-SIAM Series on Optimiation (SIAM, Philadelphia).
59. Shen Z, Dessouky MM, Ordóñez F (2009) A two-stage vehicle routing model for large-scale bioterrorism emergencies. Networks 54(4):255-269.
60. Smith SL, Pavone M, Bullo F, Frazzoli E (2010) Dynamic vehicle routing with priority classes of stochastic demands. SIAM J. Control Optim. 48(5):3224-3245.
61. Stewart WR, Golden BL (1983) Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. 14(4):371-385.
62. Sungur I, Ordóñez F, Dessouky MM (2008) A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Trans. 40(5):509-523. (Pubitemid 351386538)
63. Sungur I, Ren Y, Ordóñez F, Dessouky MM, Zhong H (2010) A model and algorithm for the courier delivery problem with uncertainty. Transportation Sci. 44(2):193-205.
64. Tarantilis CD, Stavropoulou F, Repoussis PP (2012) A template-based tabu search algorithm for the consistent vehicle routing problem. Expert Systems Appl. 39(4):4233-4239.
65. Toth P, Vigo D, eds. (2002) The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications (SIAM, Philadelphia).
66. Verderame PM, Floudas CA (2009) Operational planning of large-scale industrial batch plants under demand due date and amount uncertainty. I. Robust optimization framework. Indust. Engrg. Chemistry Res. 48(15):7214-7231.
67. Verderame PM, Floudas CA (2011) Multisite planning under demand and transportation time uncertainty: Robust optimization and conditional value-at-risk frameworks. Indust. Engrg. Chemistry Res. 50(9):4959-4982.
68. Verderame PM, Elia JA, Li J, Floudas CA (2010) Planning and scheduling under uncertainty: A review across multiple sectors. Indust. Engrg. Chemistry Res. 49(9):3993-4017.
69. Yang W-H, Mathur K, Ballou RH (2000) Stochastic vehicle routing problem with restocking. Transportation Sci. 34(1):99-112. (Pubitemid 30587602)