The robust vehicle routing problem with time windows

Computers and Operations Research

Volumn 40, Issue 3, 2013, Pages 856-866

  Agra, Agostinho ^a   Christiansen, Marielle ^b   Figueiredo, Rosa ^a   Hvattum, Lars Magnus ^b   Poss, Michael ^c,d   Requejo, Cristina ^a  

^a UNIVERSITY OF AVEIRO   (Portugal)

^b NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

^c UNIVERSITY OF COIMBRA   (Portugal)

^d UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Dynamic programming; Robust optimization; Time windows; Uncertainty polytope; Vehicle routing problem

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; CUTTING PLANES; EXTREME POINTS; MARITIME TRANSPORTATION; POLYTOPES; RESOURCE INEQUALITIES; ROBUST APPROACHES; ROBUST OPTIMIZATION; TIME WINDOWS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; EQUIPMENT TESTING; OPTIMIZATION;

WATERWAY TRANSPORTATION;

EID: 84870237221     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.10.002     Document Type: Article

References (25)

1. Agra A, Christiansen M, Figueiredo R, Magnus Hvattum L, Poss M, Requejo C. Layered formulation for the robust vehicle routing problem with time windows. In: Lecture Notes in Computer Science, vol. 7422/2012; 2012, p. 249-60.
2. N. Ascheuer, M. Fischetti, and M. Grötschel A polyhedral study of the asymmetric traveling salesman problem with time windows Networks 36 2000 69 79
3. E. Balas, and R. Jeroslow Canonical cuts on the unit hypercube SIAM Journal on Applied Mathematics 23 1972 61 79
4. A. Ben-Tal, A. Goryashko, E. Guslitzer, and A. Nemirovski Adjustable robust solutions of uncertain linear programs Mathematical Programming 99 2004 351 376
5. A. Ben-Tal, and A. Nemirovski Robust solutions of uncertain linear programs Operations Research Letters 25 1999 1 13
6. D. Bertsimas, D.B. Brown, and C. Caramanis Theory and applications of robust optimization SIAM Review 53 2011 464 501
7. D. Bertsimas, and M. Sim The price of robustness Operations Research 52 2004 35 53
8. D. Bienstock, and N. Özbay Computing robust basestock levels Discrete Optimization 5 2008 389 414
9. M. Chardy, and O. Klopfenstein Handling uncertainties in vehicle routing problems through data preprocessing Transportation Research Part E Logistics and Transportation Review 48 2012 667 683
10. C.H. Christiansen, and J. Lysgaard A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands Operations Research Letters 35 2007 773 781
11. Christiansen M, Fagerholt K, Nygreen B, Ronen D. Maritime transportation. Handbooks in operations research and management science. vol. 14; 2007. p. 189-284 [chapter].
12. G. Codato, and M. Fischetti Combinatorial Benders' cuts for mixed-integer linear programming Operations Research 54 2006 756 766
13. G. Desaulniers, and D. Villeneuve The shortest path problem with time windows and linear waiting costs Transportation Science 34 2000 312 319
14. Golden B, Raghavan S, Wasil EA. The vehicle routing problem: latest advances and new challenges. In: Operations Research/Computer Science Interfaces Series, vol. 43. Boston: Springer; 2008.
15. B. Kallehauge, N. Boland, and O.B.G. Madsen Path inequalities for the vehicle routing problem with time windows Networks 49 2007 273 293
16. Kauczynski W. Study of the reliability of the ship transportation. In: Proceeding of the international conference on ship and marine research; 1994.
17. C.E. Miller, A.W. Tucker, and R.A. Zemlin Integer programming formulation of traveling salesman problems Journal of the ACM 7 1960 326 329
18. F. Ordónez Robust vehicle routing TutORials in Operations Research 2010 153 178
19. G. Oriolo Domination between traffic matrices Mathematics of Operations Research 33 2008 91 96
20. Poss M, Raack C. Affine recourse for the robust network design problem: between static and dynamic routing. Networks, 10.1002/net.21482 in press.
21. G. Righini, and M. Salani New dynamic programming algorithms for the resource constrained elementary shortest path problem Networks 51 2008 155 170
22. A.L. Soyster Convex programming with set-inclusive constraints and applications to inexact linear programming Operations Research 21 1973 1154 1157
23. A. Subramanian, E. Uchoa, A.A. Pessoa, and L. Satoru Ochi Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery Operations Research Letters 39 2011 338 341
24. FICO Xpress Optimization Suite, Xpress-Optimizer reference manual. Technical Report Release 22.01, 2011.
25. I. Sungur, F. Ordónez, and M. Dessouky A robust optimization approach for the capacitated vehicle routing IIE Transactions 40 2008 509 523