Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty

References

• Aarts E, Lenstra JK, eds. (1997) Local Search in Combinatorial Optimization, 1st ed. (John Wiley & Sons, New York).Google Scholar
• Agra A, Christiansen M, Figueiredo R, Hvattum LM, Poss M, Requejo C (2013) The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3):856–866.Crossref, Google Scholar
• Baldacci R, Mingozzi A (2009) A unified exact method for solving different classes of vehicle routing problems. Math. Programming 120:347–380.Crossref, Google Scholar
• Baldacci R, Battarra M, Vigo D (2009) Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs. Networks 54(4):178–189.Crossref, Google Scholar
• Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Bertsekas DP (2017) Dynamic Programming and Optimal Control, 4th ed. (Athena Scientific).Google Scholar
• Bertsimas D, Sim M (2004) The price of robustness. Oper. Res. 52(1):35–53.Link, Google Scholar
• Bertsimas D, Brown DD, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.Crossref, Google Scholar
• Birge JR, Louveaux F (2008) Introduction to Stochastic Programming, 2nd ed. (Springer Science & Business Media, New York).Google Scholar
• Boyd S, Vandenberghe L (2004) Convex Optimization. (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Ceria S, Stubbs RA (2006) Incorporating estimation errors into portfolio selection: Robust portfolio construction. J. Asset Management 7(2):109–127.Crossref, Google Scholar
• Chao IM, Golden B, Wasil E (1999) A computational study of a new heuristic for the site-dependent vehicle routing problem. INFOR: Inform. Systems Oper. Res. 37(3):319–336.Crossref, Google Scholar
• Choi E, Tcha DW (2007) A column generation approach to the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 34(7):2080–2095.Crossref, Google Scholar
• Cordeau JF, Laporte G (2001) A tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR: Inform. Systems Oper. Res. 39(3):292–298.Crossref, Google Scholar
• Cordeau JF, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2):105–119.Crossref, Google Scholar
• De La Vega J, Munari P, Morabito R (2017) Robust optimization for the vehicle routing problem with multiple deliverymen. Central Eur. J. Oper. Res. 27(4):905–936.Crossref, Google Scholar
• Erera AL, Morales JC, Savelsbergh M (2010) The vehicle routing problem with stochastic demand and duration constraints. Transportation Sci. 44(4):474–492.Link, Google Scholar
• Fischetti M, González JJS, Toth P (1998) Solving the orienteering problem through branch-and-cut. INFORMS J. Comput. 10(2):133–148.Link, Google Scholar
• Funke B, Grünert T, Irnich S (2005) Local search for vehicle routing and scheduling problems: Review and conceptual integration. J. Heuristics 11(4):267–306.Crossref, Google Scholar
• Gendreau M, Jabali O, Rei W (2014) Stochastic vehicle routing problems. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods and Applications (SIAM, Philadelphia), 213–239.Google Scholar
• Golden B, Raghavan S, Wasil E (2008) The Vehicle Routing Problem: Latest Advances and New Challenges (Springer Science & Business Media, New York).Crossref, Google Scholar
• Golden B, Assad A, Levy L, Gheysens F (1984) The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11(1):49–66.Crossref, Google Scholar
• Gounaris CE, Wiesemann W, Floudas CA (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper. Res. 61(3):677–693.Link, Google Scholar
• Gounaris CE, Repoussis PP, Tarantilis CD, Wiesemann W, Floudas CA (2016) An adaptive memory programming framework for the robust capacitated vehicle routing problem. Transportation Sci. 50(4):1239–1260.Link, Google Scholar
• Hoff A, Andersson H, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: Fleet composition and routing. Comput. Oper. Res. 37(12):2041–2061.Crossref, Google Scholar
• Irnich S, Schneider M, Vigo D (2014) Four variants of the vehicle routing problem. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods and Applications (SIAM, Philadelphia), 241–271.Google Scholar
• Koç C, Bektaş T, Jabali O, Laporte G (2016) Thirty years of heterogeneous vehicle routing. Eur. J. Oper. Res. 249(1):1–21.Google Scholar
• Laporte G (2009) Fifty years of vehicle routing. Transportation Sci. 43(4):408–416.Link, Google Scholar
• Laporte G, Mercure H, Nobert Y (1986) An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16(1):33–46.Crossref, Google Scholar
• Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100(2):423–445.Crossref, Google Scholar
• McCormick ST, Rao M, Rinaldi G (2003) Easy and difficult objective functions for max cut. Math. Programming 94(2):459–466.Crossref, Google Scholar
• Munari P, Moreno A, De La Vega J, Alem D, Gondzio J, Morabito R (2018) The robust vehicle routing problem with time windows: Compact formulation and branch-price-and-cut method. Transportation Sci. 53(4):917–1212.Google Scholar
• Nag B, Golden BL, Assad AA (1988) Vehicle routing with site dependencies. Golden B, Assad A, eds. Vehicle Routing: Methods and Studies (Elsevier, Amsterdam), 149–159.Google Scholar
• Ordóñez F (2010) Robust vehicle routing. Risk and Optimization in an Uncertain World, Tutorials in Operations Research (INFORMS, Catonsville, MD), 153–178.Google Scholar
• Penna PHV, Subramanian A, Ochi LS, Vidal T, Prins C (2017) A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Ann. Oper. Res. 273(1–2):5–74.Crossref, Google Scholar
• Pessoa A, Sadykov R, Uchoa E (2018) Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems. Eur. J. Oper. Res. 270(2):530–543.Crossref, Google Scholar
• Solano-Charris EL, Prins C, Santos AC (2014) Heuristic approaches for the robust vehicle routing problem. Fouilhoux P, Gouveia L, Mahjoub A, Paschos V, eds. Combinatorial Optimization: ISCO 2014, Lecture Notes in Computer Science, vol. 8596 (Springer, Cham, Switzerland), 384–395.Google Scholar
• Solano-Charris EL, Prins C, Santos AC (2016) Solving the bi-objective robust vehicle routing problem with uncertain costs and demands. RAIRO Oper. Res. 50(4–5):689–714.Crossref, Google Scholar
• Subramanyam A (2018) Robust optimization of vehicle routing problems under uncertainty. PhD thesis, Carnegie Mellon University, Pittsburgh.Google Scholar
• Subramanyam A, Mufalli F, Laínez-Aguirre JM, Pinto JM, Gounaris CE (2017) Robust multi-period vehicle routing under customer order uncertainty. Optim. Online, last modified November 15, 2018, http://www.optimization-online.org/DB_HTML/2017/04/5947.html.Google Scholar
• Sungur I, Ordóñez F, Dessouky M (2008) A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Trans. 40(5):509–523.Crossref, Google Scholar
• Sungur I, Ren Y, Ordóñez F, Dessouky M, Zhong H (2010) A model and algorithm for the courier delivery problem with uncertainty. Transportation Sci. 44(2):193–205.Link, Google Scholar
• Taillard ÉD (1999) A heuristic column generation method for the heterogeneous fleet vrp. RAIRO Recherche Opérationnelle 33(1):1–14.Crossref, Google Scholar
• Teodorović D, Krc̆mar-Noz̆ić E, Pavkoviç G (1995) The mixed fleet stochastic vehicle routing problem. Transportation Planning Tech. 19(1):31–43.Crossref, Google Scholar
• Vigo D, Toth P (2014) Vehicle Routing: Problems, Methods and Applications (SIAM, Philadelphia).Google Scholar
• Yaman H (2006) Formulations and valid inequalities for the heterogeneous vehicle routing problem. Math. Programming 106(2):365–390.Crossref, Google Scholar
• Young NE (2001) Sequential and parallel algorithms for mixed packing and covering. Proc. 42nd IEEE Sympos. Foundations Comput. Sci., FOCS 2001 (IEEE, Piscataway, NJ), 538–546.Google Scholar
• Zhang Y, Baldacci R, Sim M, Tang J (2018) Routing optimization with time windows under uncertainty. Math. Programming 175(1–2):263–305.Crossref, Google Scholar