50th Anniversary Invited Article—Future Research Directions in Stochastic Vehicle Routing

References

• Adulyasak Y, Jaillet P (2016) Models and algorithms for stochastic and robust vehicle routing with deadlines. Transportation Sci. 50(2):608–626.Link, Google Scholar
• Ak A, Erera A (2007) A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands. Transportation Sci. 41(2):222–237.Link, Google Scholar
• Benton WC, Rossetti MD (1992) The vehicle scheduling problem with intermittent customer demands. Comput. Oper. Res. 19(6):521–531.Crossref, Google Scholar
• Bertsimas D, Chervi P, Peterson M (1995) Computational approaches to stochastic vehicle routing problems. Transportation Sci. 29(4):342–352.Link, Google Scholar
• Bertsimas DJ (1988) Probabilistic combinatorial optimization problems. Unpublished doctoral thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Bertsimas DJ (1992) A vehicle routing problem with stochastic demand. Oper. Res. 40(3):574–585.Link, Google Scholar
• Bianchi L (2006) Ant colony optimization and local search for the probabilistic traveling salesman problem: A case study in stochastic combinatorial optimization. Unpublished doctoral thesis, Université Libre de Bruxelles, Brussels, Belgium.Google Scholar
• Biesinger B, Hu B, Raidl G (2016) An integer L-shaped method for the generalized vehicle routing problem with stochastic demands. Electronic Notes Discrete Math. 52:245–252.Crossref, Google Scholar
• Birge JR, Louveaux F (1997) Introduction to Stochastic Programming (Springer-Verlag, New York).Google Scholar
• Chen L, Gendreau M, Hà MH, Langevin A (2016) A robust optimization approach for the road network daily maintenance routing problem with uncertain service time. Transportation Res. Part E 85:40–51.Crossref, Google Scholar
• Christiansen CH, Lysgaard J (2007) A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. Lett. 35(6):773–781.Crossref, Google Scholar
• Clarke GU, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4):568–581.Link, Google Scholar
• Côté J-F, Gendreau M, Potvin J-Y (2013) The vehicle routing problem with stochastic two-dimensional items. Technical report, Publication CIRRELT-2013-84, Centre interuniversitaire de recherche sur les réseaux d’entreprise, la logistique et le transport (CIRRELT), Montréal.Google Scholar
• Crainic TG, Gendreau M, Potvin J-Y (2009) Intelligent freight-transportation systems: Assessment and the contribution of operations research. Transportation Res. Part C 17(6):541–557.Crossref, Google Scholar
• Crainic TG, Hewitt M, Rei W (2016) Partial Benders decomposition strategies for two-stage stochastic integer programs. Technical report, Publication CIRRELT-2016-37, Centre interuniversitaire de recherche sur les réseaux d’entreprise, la logistique et le transport (CIRRELT), Montréal.Google Scholar
• Dayarian I, Crainic TG, Gendreau M, Rei W (2015) A branch-and-price approach for a multi-period vehicle routing problem. Comput. Oper. Res. 55:167–184.Crossref, 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
• 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
• Erera AL, Savelsbergh MWP, Uyar E (2009) Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. Networks 54(4):270–283.Crossref, Google Scholar
• Errico F, Desaulniers G, Gendreau M, Rei W, Rousseau L-M (2016) A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. Eur. J. Oper. Res. 249(1):55–66.Crossref, 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, Ghiani G, Guerriero E (2015) Time-dependent routing problems: A review. Comput. Oper. Res. 64:189–197.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, 2nd ed., MOS-SIAM Series Optimization (SIAM, Philadelphia), 213–239.Crossref, Google Scholar
• 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.Link, Google Scholar
• Gendreau M, Laporte G, Séguin R (1996) A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. 44(3):469–477.Link, Google Scholar
• Gendreau M, Khoshghalb MS, Jabali O, Rei W (2016) New recourse policies for stochastic vehicle routing. Presented at ROUTE 2016, Rambouillet, France, June 1–4.Google Scholar
• Giannopoulos GA (2004) The application of information and communication technologies in transport. Eur. J. Oper. Res. 152(2):302–320.Crossref, Google Scholar
• Goodson JC, Ohlmann JW, Thomas BW (2012) Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand. Eur. J. Oper. Res. 217(2):312–323.Crossref, Google Scholar
• Goodson JC, Ohlmann JW, Thomas BW (2013) Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits. Oper. Res. 61(1):138–154.Link, Google Scholar
• Goodson JC, Thomas BW, Ohlmann JW (2015) Restocking-based rollout policies for the vehicle routing problem with stochastic demand and duration limits. Transportation Sci. 50(2):591–607.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
• Hjorring C, Holt J (1999) New optimality cuts for a single-vehicle stochastic routing problem. Ann. Oper. Res. 86:569–584.Crossref, 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
• Jaillet P (1985) Probabilistic traveling salesman problem. Unpublished doctoral thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge.Google Scholar
• 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.Link, Google Scholar
• Jaillet P, Odoni AR (1988) The Probabilistic Vehicle Routing Problem, Vehicle Routing: Methods and Studies (North-Holland, Amsterdam), 293–318.Google Scholar
• Jézéquel A (1985) Probabilistic vehicle routing problems. Unpublished Master’s dissertation, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transportation Sci. 37(1):69–82.Link, Google Scholar
• Klibi W, Martel A, Guitouni A (2010) The design of robust value-creating supply chain networks: a critical review. Eur. J. Oper. Res. 203(2):283–293.Crossref, Google Scholar
• Lambert V, Laporte G, Louveaux FV (1993) Designing collection routes through bank branches. Comput. Oper. Res. 20(7):783–791.Crossref, Google Scholar
• Laporte G, Louveaux FV (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133–142.Crossref, Google Scholar
• Laporte G, Louveaux FV, Van Hamme L (2002) An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 50(3):415–423.Link, Google Scholar
• Lee C, Lee K, Park S (2012) Robust vehicle routing problem with deadlines and travel time/demand uncertainty. J. Oper. Res. Soc. 63(9):1294–1306.Crossref, Google Scholar
• Lei H, Laporte G, Guo B (2011) The capacitated vehicle routing problem with stochastic demands and time windows. Comput. Oper. Res. 38(12):1775–1783.Crossref, Google Scholar
• Lei H, Laporte G, Guo B (2012a) A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times. TOP 20(1):99–118.Crossref, Google Scholar
• Lei H, Laporte G, Guo B (2012b) The vehicle routing problem with stochastic demands and split deliveries. INFOR 50(2):59–71.Google Scholar
• Lemieux C (2009) Monte Carlo and Quasi-Monte Carlo Sampling, Springer Series Statist. (Springer-Verlag, New York).Google Scholar
• Leuliet A (2014) Nouvelles coupes pour le problème de tournées de véhicule avec demandes stochastiques. Unpublished Master’s thesis, École Polytechnique de Montréal, Montréal.Google Scholar
• Li X, Tian P, Leung SCH (2010) Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm. Internat. J. Production Econom. 125(1):137–145.Crossref, Google Scholar
• Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation Sci. 26(3):185–200.Link, Google Scholar
• Mendoza JE, Villegas JG (2013) A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. Optim. Lett. 7(7):1503–1516.Crossref, Google Scholar
• Mendoza JE, Rousseau L-M, Villegas JG (2015) A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints. J. Heuristics 22(4):539–566.Crossref, Google Scholar
• Mendoza JE, Castanier B, Guéret C, Medaglia AL, Velasco N (2010) A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Comput. Oper. Res. 37(11):1886–1898.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
• Pandelis DG, Kyriakidis EG, Dimitrakos TD (2012) Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands. Eur. J. Oper. Res. 217(2):324–332.Crossref, Google Scholar
• Pillac V, Gendreau M, Guéret C, Medaglia A (2013) A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1):1–11.Crossref, Google Scholar
• Rei W, Gendreau M, Soriano P (2010) A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands. Transportation Sci. 44(1):136–146.Link, 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
• Siskos Y, Sambracos E (2004) Feature issue: New technologies in transportation systems. Eur. J. Oper. Res. 152(2):301.Crossref, Google Scholar
• Solano-Charris E, Prins C, Santos AC (2014) A robust optimization approach for the vehicle routing problem with uncertain travel cost. Proc. Internat. Conf. Control, Decision, Inform. Tech. (CODIT14) (IEEE, Metz, France), 98–103.Crossref, 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
• Taş D, Dellaert N, Van Woensel T, De Kok AG (2012) Vehicle routing problem with stochastic travel times including soft time windows and service costs. Comput. Oper. Res. 40(1):214–224.Crossref, Google Scholar
• Taş D, Dellaert NN, Van Woensel T, de Kok AG (2014) The time-dependent vehicle routing problem with soft time windows and stochastic travel times. Transportation Res. Part C 48:66–83.Crossref, Google Scholar
• Taş D, Gendreau M, Dellaert N, Van Woensel T, de Kok AG (2013) Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach. Eur. J. Oper. Res. 236(3):789–799.Crossref, Google Scholar
• Tatarakis A, Minis I (2009) Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns. Eur. J. Oper. Res. 197(2):557–571.Crossref, Google Scholar
• Tillman FA (1969) The multiple terminal delivery problem with probabilistic demands. Transportation Sci. 3(3):192–204.Link, Google Scholar
• Toth P, Vigo D, eds. (2014) Vehicle Routing: Problems, Methods, and Applications, Vol. 18 (SIAM, Philadelphia).Crossref, Google Scholar
• Wang X, Regan AC (2001) Assignment models for local truckload trucking problems with stochastic service times and time window constraints. Transportation Res. Record: J. Transportation Res. Board 1771(1):61–68.Crossref, Google Scholar
• Waters CDJ (1989) Vehicle-scheduling problems with uncertainty and omitted customers. J. Oper. Res. Soc. 40(12):1099–1108.Crossref, Google Scholar
• Yang W-H, Mathur K, Ballou RH (2000) Stochastic vehicle routing problem with restocking. Transportation Sci. 34(1):99–112.Link, 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 L-M, 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