The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty

References

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