Evaluation of recoverable-robust timetables on tree networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5874 LNCS, Issue , 2009, Pages 24-35

  D'Angelo, Gianlorenzo ^a   Di Stefano, Gabriele ^a   Navarra, Alfredo ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL PROBLEM; NP-HARD; OPERATIONAL PHASE; PLANNING PHASE; POLYNOMIAL-TIME ALGORITHMS; RANDOM NETWORK; RE-SCHEDULING; RUNTIMES; THEORETICAL POINTS; TIMETABLING; TREE NETWORK;

ALGORITHMS; COMPUTER SYSTEM RECOVERY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; ROBUSTNESS (CONTROL SYSTEMS);

COMBINATORIAL MATHEMATICS;

EID: 78650619492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10217-2_6     Document Type: Conference Paper

References (16)

1. Cicerone, S., D'Angelo, G., Di Stefano, G., Frigioni, D., Navarra, A.: Delay Management Problem: Complexity Results and Robust Algorithms. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 458-468. Springer, Heidelberg (2008).
2. De Giovanni, L., Heilporn, G., Labbé, M.: Optimization models for the delay management problem in public transportation. European Journal of Operational Research 189(3), 762-774 (2007).
3. Gatto, M., Jacob, R., Peeters, L., Schöbel, A.: The Computational Complexity of Delay Management. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 227-238. Springer, Heidelberg (2005).
4. Gatto, M., Jacob, R., Peeters, L., Widmayer, P.: Online Delay Management on a Single Train Line. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol. 4359, pp. 306-320. Springer, Heidelberg (2007).
5. Ginkel, A., Schöbel, A.: The bicriteria delay management problem. Transportation Science 41(4), 527-538 (2007).
6. Schöbel, A.: A model for the delay management problem based on mixed integer programming. ENTCS 50(1), 1-10 (2004).
7. Schöbel, A.: Integer programming approaches for solving the delay management problem. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol. 4359, pp. 145-170. Springer, Heidelberg (2007).
8. Cicerone, S., D'Angelo, G., Di Stefano, G., Frigioni, D., Navarra, A.: Robust Algorithms and Price of Robustness in Shunting Problems. In: Proc. of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, pp. 175-190 (2007).
9. Liebchen, C., Lübbecke, M., Möhring, R.H., Stiller, S.: Recoverable robustness. Technical Report ARRIVAL-TR-0066, ARRIVAL Project (2007).
10. D'Angelo, G., Di Stefano, G., Navarra, A.: Recoverable robust timetables on trees. Technical Report ARRIVAL-TR-0163, ARRIVAL project (2008).
11. Cicerone, S., Di Stefano, G., Schachtebeck, M., Schöbel, A.: Dynamic Algorithms for Recoverable Robustness Problems. In: Proc. of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (2008).
12. Trenitalia, http://www.trenitalia.com/.
13. Levy, F., Thompson, G., Wies, J.: The ABCs of the Critical Path Method. Graduate School of Business Administration. Harvard University (1963).
14. http://informatica.ing.univaq.it/misc/TimetablingTree2009/.
15. D'Angelo, G., Di Stefano, G., Navarra, A.: Recoverable-robust timetables for trains on single-line corridors. Technical Report ARRIVAL-TR-0180, ARRIVAL project (2008).
16. D'Angelo, G., Di Stefano, G., Navarra, A.: Recoverable-robust timetables for trains on single-line corridors. In: 3rd International Seminar on Railway Operations Modelling and Analysis, RailZurich (2009).