Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances q

Information Sciences

Volumn 190, Issue , 2012, Pages 107-126

  Cicerone, Serafino ^a   Di Stefano, Gabriele ^a   Schachtebeck, Michael ^b   Schöbel, Anita ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

Delay management; Dynamic algorithms; Optimization problems; Recovery; Robustness; Timetabling

Indexed keywords

OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING;

DELAY MANAGEMENT; DYNAMIC ALGORITHM; OPTIMIZATION PROBLEMS; RAILWAY OPTIMIZATIONS; RECOVERY STRATEGIES; ROBUST OPTIMIZATION; TIMETABLING; UNIFIED FRAMEWORK;

RECOVERY;

EID: 84865789867     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2011.12.010     Document Type: Article

References (35)

1. H.G. Bayer, B. Sendhoff, Robust optimization-A comprehensive survey, Computer Methods in Applied Mechanics and Engineering 196 (33-34) (2007) 3190-3218.
2. A. Ben-Tal, L. El Ghaoui, A. Nemirovski, Mathematical Programming: Special Issue on Robust Optimization, vol. 107:1, Springer, Berlin, 2006.
3. A. Ben-Tal, L. El Ghaoui, A. Nemirovski, Robust Optimization, Princeton University Press, Princeton and Oxford, 2009.
4. A. Ben-Tal, A. Goryashko, E. Guslitzer, A. Nemirovski, Adjustable robust solutions of uncertain linear programs, Mathematical Programming A 99 (2003) 351-376.
5. A. Ben-Tal, A. Nemirovski, Robust convex optimization, Mathematics of Operations Research 23 (4) (1998) 769-805.
6. A. Ben-Tal, A. Nemirovski, Robust solutions of linear programming problems contaminated with uncertain data, Mathematical Programming A 88 (2000) 411-424.
7. D. Bertsimas, M. Sim, The price of robustness, Operations Research 52 (1) (2004) 35-53.
8. J.R. Birge, F.V. Louveaux, Introduction to Stochastic Programming, Springer-Verlag, New York, 1997.
9. A. Borodin, R. El-Yaniv (Eds.), Online Computation and Competitive Analysis, Cambridge University Press, 1998.
10. Chiu-Hung Chen, Ta-Yuan Chou, Tung-Kuan Liu, Jyh-Horng Chou, Chung-Nan Lee, Optimization of short-haul airline crew pairing problems using a multiobjective genetic algorithm, International Journal of Innovative Computing, Information and Control (2010) 3943-3960.
11. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra, Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases, Journal of Combinatorial Optimization 18 (3) (2009) 229-257.
12. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra, Recoverable robustness for train shunting problems, Algorithmic Operations Research 4 (2) (2009) 102-116.
13. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra, M. Schachtebeck, A. Schöbel, Recoverable robustness in shunting and timetabling, in: Robust and Online Large-Scale Optimization, Lecture Notes in Computer Science, vol. 5868, Springer, 2009, pp. 28-60.
14. Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel. Dynamic algorithms for recoverable robustness problems, in: 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08), vol. 9 of OASICS. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Germany, 2008.
15. A.L. Erera, J.C. Morales, M. Svalesbergh, Robust optimization for empty repositioning problems, Operations Research 57 (2) (2009) 468-483.
16. M. Fischetti, M. Monaci, Robust optimization through branch-And-price, in: Proceedings of the 37th Annual Conference of the Italian Operations Research Society (AIRO), 2006.
17. M. Fischetti, M. Monaci, Light robustness, in: R.K. Ahuja, R.H. Möhring, C.D. Zaroliagis (Eds.), Robust and Online Large-Scale Optimization, Lecture Note on Computer Science, vol. 5868, Springer, 2009, pp. 61-84.
18. M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.
19. M. Gatto, B. Glaus, R. Jacob, L. Peeters, P. Widmayer, Railway delay management: exploring its algorithmic complexity, in: Algorithm Theory-Proceedings SWAT 2004, LNCS, vol. 3111, Springer, 2004, pp. 199-211.
20. M. Gatto, R. Jacob, L. Peeters, A. Schöbel, The computational complexity of delay management, in: Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science, vol. 3787, 2005.
21. M. Gatto, R. Jacob, L. Peeters, P. Widmayer, Online delay management on a single train line, in: Proceedings of the Algorithmic Methods for Railway Optimization (ATMOS04), vol. 4359 of Lecture Notes in Computer Science, 2007.
22. A. Ginkel, A. Schöbel, The bicriteria delay management problem, Transportation Science 41 (4) (2007) 527-538.
23. L. Giovanni, G. Heilporn, M. Labbé, Optimization models for the delay management problem in public transportation, European Journal of Operational Research 189 (3) (2008) 762-774.
24. Hesam Izakian, Behrouz Tork Ladani, Ajith Abraham, Vaclav Snasel, A discrete particle swarm optimization approach for grid job scheduling, International Journal of Innovative Computing, Information and Control 6 (9) (2010) 4219-4234.
25. P. Kall, S.W. Wallace, Stochastic Programming, Wiley, Chichester, 1994.
26. F.K. Levy, G.L. Thompson, J.D. Wies, The ABCs of the Critical Path Method, Graduate School of Business Administration, Harvard University, 1963.
27. R. Lewis, A survey of metaheuristic-based techniques for university timetabling problems, OR Spectrum 30 (1) (2008) 167-190.
28. C. Liebchen, M. Lüebbecke, R.H. Möhring, S. Stiller, The concept of recoverable rrobustness, linear programming recoery, and railway applications, in: R.K. Ahuja, R.H. Möhring, C.D. Zaroliagis (Eds.), Robust and Online Large-Scale Optimization, Lecture Note on Computer Science, vol. 5868, Springer, 2009.
29. C. Liebchen, M. Schachtebeck, A. Schöbel, S. Stiller, A. Prigge, Computing delay resistant railway timetables, Computers & OR 37 (5) (2010) 857-868.
30. A. Ruszczynski, A. Shapiro (Eds.), Stochastic Programming, Handbooks in Operations Research and Management Science, vol. 10, North-Holland, 2003.
31. M. Schachtebeck, A. Schöbel, To wait or not to wait and who goes first? Delay management with priority decisions, Transportation Science 44 (3) (2010) 307-321.
32. A. Schöbel, A model for the delay management problem based on mixed integer programming, Electronic Notes in Theoretical Computer Science 50 (1) (2001).
33. A. Schöbel, Book Chapter: Integer programming approaches for solving the delay management problem, vol. 4359 of Lecture Notes in Computer Science, 2007, pp. 145-170.
34. A. Schöbel, Line planning in public transportation: models and methods, OR Spectrum, in press, doi:10.1007/s00291-011-0251-6.
35. R. Zhang, C. Wu, Bottleneck machine identification based on optimization for the job shop scheduling problem, ICIC Express Letters 2 (2) (2008) 175- 180.