Robust constrained shortest path problems under budgeted uncertainty

Networks

Volumn 66, Issue 2, 2015, Pages 98-111

  Alves Pessoa, Artur ^a   Di Puglia Pugliese, Luigi ^b   Guerriero, Francesca ^b   Poss, Michael ^c  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b UNIVERSITY OF CALABRIA   (Italy)

^c LIRMM   (France)

Author keywords

budgeted uncertainty; constrained shortest path; dynamic programming; label setting algorithm; np hard; robust optimization; time windows

Indexed keywords

DYNAMIC PROGRAMMING; GRAPH THEORY; NP-HARD;

BUDGETED UNCERTAINTY; CONSTRAINED SHORTEST PATH; LABEL-SETTING ALGORITHM; ROBUST OPTIMIZATION; TIME WINDOWS;

BUDGET CONTROL;

EID: 84938992634     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.21615     Document Type: Article

References (29)

1. A. Agra, M. Christiansen, R. Figueiredo, L.M. Hvattum, M. Poss, and, C. Requejo, Layered formulation for the robust vehicle routing problem with time windows, ISCO 7422 (2012), 249-260.
2. A. Agra, M. Christiansen, R. Figueiredo, L.M. Hvattum, M. Poss, and, C. Requejo, The robust vehicle routing problem with time windows, Comput Oper Res 40 (2013), 856-866.
3. H. Aissi, C. Bazgan, and, D. Vanderpooten, Min-max and min-max regret versions of combinatorial optimization problems: A survey, Eur J Oper Res 197 (2009), 427-438.
4. E. Álvarez-Miranda, I. Ljubic, and, P. Toth, A note on the Bertsimas and Sim algorithm for robust combinatorial optimization problems, 4OR 11 (2013), 349-360.
5. A. Ben-Tal, L.E. Ghaoui, and, A. Nemirovski, Robust optimization, Princeton University Press, US, 2009.
6. D. Bertsimas, and, M. Sim, Robust discrete optimization and network flows, Math Program 98 (2003), 49-71.
7. D. Bertsimas, and, M. Sim, The price of robustness, Oper Res 52 (2004), 35-53.
8. J.R. Birge, and, F.V. Louveaux, Introduction to stochastic programming, 2nd edition, Springer Verlag, New York, 2011.
9. N. Boland, J. Dethridge, and, I. Dumitrescu, Accelerated label setting algorithms for the elementary resource constrained shortest path problem, Oper Res Lett 34 (2006), 58-68.
10. D. Catanzaro, M. Labbé, and, M. Salazar-Neumann, Reduction approaches for robust shortest path problems, Comput Oper Res 38 (2011), 1610-1619.
11. M. Desrochers, and, F. Soumis, A generalized permanent labelling algorithm for the shortest path problem with time windows, INFOR 26 (1988), 191-212.
12. L. Di Puglia Pugliese, and, F. Guerriero, A survey of resource constrained shortest path problems: Exact solution approaches, Networks 62 (2013), 183-200.
13. M. Dror, Note on the complexity of the shortest path models for column generation in VRPTW, Oper Res 42 (1994), 977-978.
14. I. Dumitrescu, and, N. Boland, Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem, Networks 42 (2003), 135-153.
15. V. Gabrel, C. Murat, and, L. Wu, New models for the robust shortest path problem: Complexity, resolution and generalization, Ann Oper Res 207 (2013), 97-120.
16. M.R. Garey, and, D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W. H. Freeman and Co., New York, NY, 1990.
17. K.S. Goetzmann, S. Stiller, and, C. Telha, Optimization over integers with robustness in cost and few constraints, WAOA 2011, 89-101.
18. C.E. Gounaris, W. Wiesemann, and, C.A. Floudas, The robust capacitated vehicle routing problem under demand uncertainty, Oper Res 61 (2013), 677-693.
19. S. Irnich, and, G. Desaulniers, " Shortest path problems with resource constraints," Column generation, G. Desaulniers, J. Desrosiers, and, M. Solomon, (Editors), Springer US, 2005, pp. 33-65.
20. B. Jaumard, F. Semet, and, T. Vovor, A two-phase resource constrained shortest path algorithm for acyclic graphs, Cahiers du GERAD, report G-96-48, September 1996.
21. H.C. Joksch, The shortest route problem with constraints, J Math Anal Appl 14 (1966), 191-197.
22. P. Kouvelis, and, G. Yu, Robust discrete optimization and its applications, Kluwer Academic Publishers, Boston, 1997.
23. F. Ordõnez, Robust vehicle routing, TUTORIALS in Oper Res (2010), 153-178.
24. M. Poss, Robust combinatorial optimization with variable budgeted uncertainty, 4OR 11 (2013), 75-92.
25. M. Poss, Robust combinatorial optimization with variable cost uncertainty, Eur J Oper Res 237 (2014), 836-845.
26. I. Sungur, F. Ordõnez, and, M. Dessouky, A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty, IIE Trans 40 (2008), 509-523.
27. F. Talla Nobibon, and, R. Leus, Complexity results and exact algorithms for robust knapsack problems, J Optim Theory Appl 161 (2014), 533-552.
28. G. Yu, and, J. Yang, On the robust shortest path problem, Comput Oper Res 25 (1998), 457-468.
29. P. Zieliński, The computational complexity of the relative robust shortest path problem with interval data, Eur J Oper Res 158 (2004), 570-576.