50th Anniversary invited article future research directions in stochastic vehicle routing

Transportation Science

Volumn 50, Issue 4, 2016, Pages 1163-1173

  Gendreau, Michel ^a,b   Jabali, Ola ^a,c   Rei, Walter ^a,d  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^c HEC MONTRÉAL   (Canada)

^d UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

Algorithmic issues; Recourse policies; Research directions; Stochastic vehicle routing

Indexed keywords

VEHICLE ROUTING; VEHICLES;

ALGORITHMIC ISSUES; APPROXIMATE SOLUTION; COMPUTATIONAL CHALLENGES; FUTURE RESEARCH DIRECTIONS; MODELING PARADIGMS; STOCHASTIC PHENOMENA; STOCHASTIC VEHICLE ROUTING; VEHICLE ROUTING PROBLEM;

STOCHASTIC SYSTEMS;

EID: 84995494477     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.2016.0709     Document Type: Article

References (74)

1. Adulyasak Y, Jaillet P (2016) Models and algorithms for stochastic and robust vehicle routing with deadlines. Transportation Sci. 50(2):608-626.
2. Ak A, Erera A (2007) A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands. Transportation Sci. 41(2):222-237.
3. Benton WC, Rossetti MD (1992) The vehicle scheduling problem with intermittent customer demands. Comput. Oper. Res. 19(6):521-531.
4. Bertsimas D, Chervi P, Peterson M (1995) Computational approaches to stochastic vehicle routing problems. Transportation Sci. 29(4):342-352.
5. Bertsimas DJ (1988) Probabilistic combinatorial optimization problems. Unpublished doctoral thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge.
6. Bertsimas DJ (1992) A vehicle routing problem with stochastic demand. Oper. Res. 40(3):574-585.
7. 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.
8. 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.
9. Birge JR, Louveaux F (1997) Introduction to Stochastic Programming (Springer-Verlag, New York).
10. 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.
11. 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.
12. Clarke GU, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4):568-581.
13. 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.
14. Crainic TG, Gendreau M, Potvin J-Y (2009) Intelligent freighttransportation systems: Assessment and the contribution of operations research. Transportation Res. Part C 17(6):541-557.
15. 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.
16. Dayarian I, Crainic TG, Gendreau M, Rei W (2015) A branch-Andprice approach for a multi-period vehicle routing problem. Comput. Oper. Res. 55:167-184.
17. Dror M, Laporte G, Trudeau P (1989) Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. 23(3):166-176.
18. Erera AL, Morales JC, Savelsbergh M (2010) The vehicle routing problem with stochastic demand and duration constraints. Transportation Sci. 44(4):474-492.
19. 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.
20. 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.
21. Gauvin C, Desaulniers G, Gendreau M (2014) A branch-cut-Andprice algorithm for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 50:141-153.
22. Gendreau M, Ghiani G, Guerriero E (2015) Time-dependent routing problems: A review. Comput. Oper. Res. 64:189-197.
23. 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.
24. 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.
25. 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.
26. 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.
27. Giannopoulos GA (2004) The application of information and communication technologies in transport. Eur. J. Oper. Res. 152(2):302-320.
28. 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.
29. 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.
30. 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.
31. Gounaris CE, Wiesemann W, Floudas CA (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper. Res. 61(3):677-693.
32. Hjorring C, Holt J (1999) New optimality cuts for a single-vehicle stochastic routing problem. Ann. Oper. Res. 86:569-584.
33. 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.
34. Jaillet P (1985) Probabilistic traveling salesman problem. Unpublished doctoral thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge.
35. 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.
36. Jaillet P, Odoni AR (1988) The Probabilistic Vehicle Routing Problem, Vehicle Routing: Methods and Studies (North-Holland, Amsterdam), 293-318.
37. Jézéquel A (1985) Probabilistic vehicle routing problems. Unpublished Master's dissertation, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge.
38. Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transportation Sci. 37(1):69-82.
39. Klibi W, Martel A, Guitouni A (2010) The design of robust valuecreating supply chain networks: A critical review. Eur. J. Oper. Res. 203(2):283-293.
40. Lambert V, Laporte G, Louveaux FV (1993) Designing collection routes through bank branches. Comput. Oper. Res. 20(7): 783-791.
41. Laporte G, Louveaux FV (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133-142.
42. 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.
43. 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.
44. 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.
45. 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.
46. Lei H, Laporte G, Guo B (2012b) The vehicle routing problem with stochastic demands and split deliveries. INFOR 50(2):59-71.
47. Lemieux C (2009) Monte Carlo and Quasi-Monte Carlo Sampling, Springer Series Statist. (Springer-Verlag, New York).
48. 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.
49. 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.
50. Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation Sci. 26(3):185-200.
51. Mendoza JE, Villegas JG (2013) A multi-space sampling heuristic for the vehicle routing problem with stochastic demands. Optim. Lett. 7(7):1503-1516.
52. 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.
53. 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.
54. 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.
55. 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.
56. 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.
57. 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.
58. Secomandi N (2000) Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper. Res. 27(11-12):1201-1225.
59. Secomandi N (2001) A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49(5):796-802.
60. Secomandi N, Margot F (2009) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57(1):214-230.
61. Siskos Y, Sambracos E (2004) Feature issue: New technologies in transportation systems. Eur. J. Oper. Res. 152(2):301.
62. 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. 4CODIT145 (IEEE, Metz, France), 98-103.
63. 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.
64. Tas 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.
65. Tas 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.
66. Tas 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.
67. 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.
68. Tillman FA (1969) The multiple terminal delivery problem with probabilistic demands. Transportation Sci. 3(3):192-204.
69. Toth P, Vigo D, eds. (2014) Vehicle Routing: Problems, Methods, and Applications, Vol. 18 (SIAM, Philadelphia).
70. 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.
71. Waters CDJ (1989) Vehicle-scheduling problems with uncertainty and omitted customers. J. Oper. Res. Soc. 40(12):1099-1108.
72. Yang W-H, Mathur K, Ballou RH (2000) Stochastic vehicle routing problem with restocking. Transportation Sci. 34(1):99-112.
73. Yee JR, Golden BL (1980) A note on determining operating strategies for probabilistic vehicle routing. Naval Res. Logist. Quart. 27(1):159-163.
74. 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.