Vehicle Routing with Stochastic Demands and Partial Reoptimization

References

• Ak A, Erera AL (2007) A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands. Transportation Sci. 41(2):222–237.Link, Google Scholar
• Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming 115(2):351–385.Crossref, Google Scholar
• Bertazzi L, Secomandi N (2020) Technical note: Worst-case benefit of restocking for the vehicle routing problem with stochastic demands. Oper. Res. 68(3):671–675.Link, Google Scholar
• Chan Y, Carter WB, Burnes MD (2001) A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Comput. Oper. Res. 28(8):803–826.Crossref, Google Scholar
• Chepuri K, Homem-de Mello T (2005) Solving the vehicle routing problem with stochastic demands using the cross-entropy method. Ann. Oper. Res. 134(1):153–181.Crossref, Google Scholar
• Costa L, Contardo C, Desaulniers G (2019) Exact branch-price-and-cut algorithms for vehicle routing. Transportation Sci. 53(4):946–985.Link, Google Scholar
• Dinh T, Fukasawa R, Luedtke J (2018) Exact algorithms for the chance-constrained vehicle routing problem. Math. Programming 172(1–2):105–138.Crossref, Google Scholar
• Dror M, Laporte G, Louveaux FV (1993) Vehicle routing with stochastic demands and restricted failures. Zeitschrift Oper. Res. 37(3):273–283.Google Scholar
• Dror M, Laporte G, Trudeau P (1989) Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. 23(3):166–176.Link, Google Scholar
• Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216–229.Crossref, Google Scholar
• Florio AM, Absi N, Feillet D (2021) Routing electric vehicles on congested street networks. Transportation Sci. 55(1):238–256.Link, Google Scholar
• Florio AM, Hartl RF, Minner S (2020a) New exact algorithm for the vehicle routing problem with stochastic demands. Transportation Sci. 54(4):1073–1090.Link, Google Scholar
• Florio AM, Hartl RF, Minner S (2020b) Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 285(1):172–182.Crossref, Google Scholar
• Florio AM, Hartl RF, Minner S, Salazar-González JJ (2021) A branch-and-price algorithm for the vehicle routing problem with stochastic demands and probabilistic duration constraints. Transportation Sci. 55(1):122–138.Link, Google Scholar
• Gauvin C, Desaulniers G, Gendreau M (2014) A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 50:141–153.Crossref, Google Scholar
• Gendreau M, Jabali O, Rei W (2016) 50th anniversary invited article—Future research directions in stochastic vehicle routing. Transportation Sci. 50(4):1163–1173.Link, Google Scholar
• Ghosal S, Wiesemann W (2020) The distributionally robust chance constrained vehicle routing problem. Oper. Res. 68(3):716–732.Link, 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
• Jabali O, Rei W, Gendreau M, Laporte G (2014) Partial-route inequalities for the multi-vehicle routing problem with stochastic demands. Discrete Appl. Math. 177:121–136.Crossref, Google Scholar
• Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2):497–511.Link, Google Scholar
• Lambert V, Laporte G, Louveaux F (1993) Designing collection routes through bank branches. Comput. Oper. Res. 20(7):783–791.Crossref, Google Scholar
• Louveaux FV, Salazar-González JJ (2018) Exact approach for the vehicle routing problem with stochastic demands and preventive returns. Transportation Sci. 52(6):1463–1478.Link, 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
• Markov I, Bierlaire M, Cordeau JF, Maknoon Y, Varone S (2020) Waste collection inventory routing with non-stationary stochastic demands. Comput. Oper. Res. 113:104798.Crossref, Google Scholar
• Noorizadegan M, Chen B (2018) Vehicle routing with probabilistic capacity constraints. Eur. J. Oper. Res. 270(2):544–555.Crossref, Google Scholar
• Novoa C, Storer R (2009) An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 196(2):509–515.Crossref, Google Scholar
• Oyola J, Arntzen H, Woodruff DL (2017) The stochastic vehicle routing problem, a literature review, part II: Solution methods. EURO J. Transportation Logist. 6(4):349–388.Crossref, Google Scholar
• Oyola J, Arntzen H, Woodruff DL (2018) The stochastic vehicle routing problem, a literature review, part I: Models. EURO J. Transportation Logist. 7(3):193–221.Crossref, Google Scholar
• Poggi M, Uchoa E (2014) New exact algorithms for the capacitated vehicle routing problem. Toth P, Vigo D, eds. Vehicle Routing: Problems, Methods, and Applications, 2nd ed., MOS-SIAM Series on Optimization (Society for Industrial and Applied Mathematics, Philadelphia), 59–86.Crossref, Google Scholar
• Salavati-Khoshghalb M, Gendreau M, Jabali O, Rei W (2019a) A rule-based recourse for the vehicle routing problem with stochastic demands. Transportation Sci. 53(5):1334–1353.Link, Google Scholar
• Salavati-Khoshghalb M, Gendreau M, Jabali O, Rei W (2019b) An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy. Eur. J. Oper. Res. 273(1):175–189.Crossref, Google Scholar
• Secomandi N (2000) Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 27(11-12):1201–1225.Crossref, Google Scholar
• Secomandi N (2001) A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49(5):796–802.Link, Google Scholar
• Secomandi N, Margot F (2009) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57(1):214–230.Link, Google Scholar
• Singer M, Donoso P, Jara S (2002) Fleet configuration subject to stochastic demand: An application in the distribution of liquefied petroleum gas. J. Oper. Res. Soc. 53(9):961–971.Crossref, Google Scholar
• Uchoa E, Pecin D, Pessoa A, Poggi M, Vidal T, Subramanian A (2017) New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3):845–858.Crossref, Google Scholar
• Yee JR, Golden BL (1980) A note on determining operating strategies for probabilistic vehicle routing. Naval Res. Logist. Quart. 27(1):159–163.Crossref, Google Scholar
• Zhu L, Rousseau LM, Rei W, Li B (2014) Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 50:1–13.Crossref, Google Scholar