Optimizing road network daily maintenance operations with stochastic service and travel times

Transportation Research Part E: Logistics and Transportation Review

Volumn 64, Issue , 2014, Pages 88-102

  Chen, Lu ^a   Hà, Minh Hoàng ^b   Langevin, André ^c   Gendreau, Michel ^c  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

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

Author keywords

Adaptive neighborhood search algorithm; Capacitated arc routing problem; Chance constrained programming model; Stochastic; Stochastic programming model with recourse

Indexed keywords

CONSTRAINED OPTIMIZATION; INTEGER PROGRAMMING; LEARNING ALGORITHMS; ROADS AND STREETS; ROUTING ALGORITHMS; STOCHASTIC MODELS; STOCHASTIC PROGRAMMING; STOCHASTIC SYSTEMS;

ADAPTIVE NEIGHBORHOOD; ADAPTIVE NEIGHBORHOOD SEARCH ALGORITHM; CAPACITATED ARC ROUTING PROBLEM; CHANCE-CONSTRAINED PROGRAMMING MODEL; MAINTENANCE OPERATIONS; NEIGHBORHOOD SEARCH ALGORITHMS; ROAD NETWORK; STOCHASTIC PROGRAMMING MODEL; STOCHASTIC PROGRAMMING MODEL WITH RECOURSE; STOCHASTICS;

TRAVEL TIME;

ALGORITHM; MAINTENANCE; NUMERICAL MODEL; OPTIMIZATION; ROAD TRANSPORT; STOCHASTICITY; TRAVEL TIME;

EID: 84896748387     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2014.02.002     Document Type: Article

References (36)

1. Adulyasak Y., Cordeau J.-F., Jans R. Formulations and branch-and-cut algorithms for multi-vehicle production and inventory routing problems. INFORMS J. Comput. 2014, 26(1):103-120.
2. Assad A.A., Golden B.L. Arc routing methods and applications. Network routing. Handbooks of Operations Research and Management Science 1995, vol. 8. North Holland.
3. Brandão J., Eglese R. A deterministic tabu search algorithm for the capacitated arc routing problem. Comput. Oper. Res. 2008, 35:1112-1126.
4. Christiansen C.H., Lysgaard J., Wøhlk S. A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands. Oper. Res. Lett. 2009, 37:392-398.
5. Coelho L.C., Cordeau J.-F., Laporte G. The inventory-routing problem with transshipment. Comput. Oper. Res. 2012, 39(11):2537-2548.
6. Corberán A., Princ C. Recent results on arc routing problems: an annotated bibliography. Networks 2010, 56(1):50-69.
7. Arc Routing: Theory, Solutions and Applications 2000, Kluwer Academic Publishers. M. Dror (Ed.).
8. Fleischmann B., Gietz M., Gnutzmann S. Time-varying travel times in vehicle routing. Transp. Sci. 2004, 38(2):160-173.
9. Fleury G., Lacomme P., Prins C. Evolutionary algorithms for stochastic arc routing problems. EvoWorkshops 2004, 501-512. Springer-Verlag, Berlin, Heidelberg. G.R. Raidl (Ed.).
10. Fleury G., Lacomme P., Prins C., Ramdane-Chérif W. Improving robustness of solutions to arc routing problems. J. Oper. Res. Soc. 2005, 56(5):526-538.
11. Gendreau M., Laporte G., Séguin R. Stochastic vehicle routing. Eur. J. Oper. Res. 1996, 88:3-12.
12. Golden B.L., Wong R. Capacitated arc routing problems. Networks 1981, 11:305-315.
13. Golden B.L., DeArmon J.S., Baker E.K. Computational experiments with algorithms for a class of routing problems. Comput. Oper. Res. 1983, 10(1):47-59.
14. Haghani A., Jung S. A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res. 2005, 32:2959-2986.
15. Hà M.-H., Bostel N., Langevin A., Rousseau L.-M. Solving the close enough arc routing problem. Networks 2014, 63(1):107-118.
16. Hà, M.-H., Bostel, N., Langevin, A., Rousseau, L.-M., 2012. An exact algorithm for the close enough traveling salesman problem with arc covering constraints. In: Proceedings of the 1st International Conference on Operations Research and Enterprise Systems (ICORES), Vilamoura, Algavre, Portugal, 4-6 February, 2012, pp. 233-239.
17. Ichoua S., Gendreau M., Potvin J.Y. Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 2003, 144:379-396.
18. Kao E.P.C. A preference order dynamic program for a stochastic traveling salesman problem. Oper. Res. 1978, 26(6):1033-1045.
19. Kaparias I., Bell M.G.H., Belzner H. A new measure of travel time reliability for in-vehicle navigation systems. J. Intell. Transp. Syst. 2008, 12(4):202-211.
20. Kenyon A.S., Morton D.P. Stochastic vehicle routing with random travel times. Transp. Sci. 2003, 37(1):69-82.
21. Laporte G., Louveaux F., Mercure H. The vehicle routing problem with stochastic travel times. Transp. Sci. 1992, 26(3):161-170.
22. Laporte G., Musmanno R., Vocaturo F. An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transp. Sci. 2010, 44(1):125-135.
23. Lecluyse C., Van Wosensel T., Peremans H. Vehicle routing with stochastic time-dependent travel times. 4OR: A Quart. J. Oper. Res. 2009, 7(4):363-377.
24. Li X., Tian P., Leung S.C.H. Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int. J. Prod. Econ. 2010, 125:137-145.
25. Malandraki C., Daskin M. Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp. Sci. 1992, 26(3):185-200.
26. Ropke S., Pisinger D. An adaptive large neighbourhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 2006, 40(3):455-472.
27. Russell R.A., Urban T.L. Vehicle routing with soft time windows and erlang travel times. J. Oper. Res. Soc. 2008, 59:1220-1228.
28. Salazar-Aguilar M.-A., Langevin A., Laporte G. The synchronized arc and node routing problem: application to road marking. Comput. Oper. Res. 2013, 40(7):1708-1715.
29. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. Lect. Notes Comput. Sci. 1998, 1520:417-431. Springer, Berlin.
30. Sniedovich M. Analysis of a preference order traveling salesman problem. Oper. Res. 1981, 29(6):1234-1237.
31. Tagmouti M., Gendreau M., Potvin J.V. Arc routing problems with time-dependent service costs. Eur. J. Oper. Res. 2007, 181:30-39.
32. Tagmouti M., Gendreau M., Potvin J.V. A dynamic capacitated arc routing problem with time-dependent service costs. Transp. Res. Part C 2011, 19:20-28.
33. Tas D., Dellaert N., van Woensel T., de Kok T. Vehicle routing problem with stochastic travel times including soft time windows. Comput. Oper. Res. 2013, 40:214-224.
34. Tas D., Gendreau M., Dellaert N., van Woensel T., de Kok A.G. Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach. Eur. J. Oper. Res. 2013, 2:1. 10.1016/j.ejor.2013.05.024.
35. Van Woensel T., Kerbache L., Peremans H., Vandaele N. Vehicle routing with dynamic travel times: a queueing approach. Eur. J. Oper. Res. 2008, 186:990-1007.
36. Zhang T., Chaovalitwongse W.A., Zhang Y. Scatter search for the stochastic travel time vehicle routing problem with simultaneous pick-ups and deliveries. Comput. Oper. Res. 2012, 39:2277-2290.