Delay resistant timetabling

Public Transport

Volumn 1, Issue 1, 2009, Pages 55-72

  Liebchen, Christian ^a   Stiller, Sebastian ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CUSTOMERS' SATISFACTION; GENERAL TOOLS; HEURISTIC APPROACH; LARGE NETWORKS; MANAGEMENT DECISIONS; OPTIMIZATION PROBLEMS; PUBLIC TRANSPORT; SERIES-PARALLEL GRAPH; TIMETABLING; TRAVEL TIME;

HEURISTIC METHODS;

SCHEDULING;

EID: 70349864211     PISSN: 1866749X     EISSN: 16137159     Source Type: Journal    
DOI: 10.1007/s12469-008-0004-3     Document Type: Article

References (11)

1. Berger A, Lorenz U, Hoffmann R, Stiller S (2008) TOPSU-RDM: a simulation platform for railway delay management. In: Proceedings of SimuTools, 2008.
2. Bertsimas D, Sim M (2003) Robust discrete optimization and network flows. Math Program Ser B 98: 49-71.
3. Gatto M, Jacob R, Peeters LWP, Schöbel A (2005) The computational complexity of delay management. In: Kratsch D (ed) Graph-theoretic concepts in computer science (WG 2005). LNCS, vol 3787. Springer, Berlin, pp 227-238.
4. Hagstrom J, Jane N (1990) Computing the probability distribution of project duration in a PERT network. Networks 20: 231-244.
5. Kroon LG, Dekker R, Vromans M (2007) Cyclic railway timetabling: a stochastic optimization approach. In: Geraets F et al. (eds) Algorithmic methods for railway optimization. LNCS, vol 4359. Springer, Berlin, pp 41-66.
6. Liebchen C, Möhring RH (2007) The modeling power of the periodic event scheduling problem: railway timetables-and beyond. In: Geraets F et al. (eds) Algorithmic methods for railway optimization. LNCS, vol 4359. Springer, Berlin, pp 41-66.
7. Liebchen C, Proksch M, Wagner F (2008) Performance of algorithms for periodic timetable optimization. In: Hickman M et al. (eds) Computer-aided systems in public transport. LNEMS, vol 600. Springer, New York, pp 151-180.
8. Ludwig A, Möhring R, Stork F (2001) A computational study on bounding the makespan distribution in stochastic project networks. Ann Oper Res 102: 49-64.
9. Shapiro A, Nemirovski A (2005) On complexity of stochastic programming problems. In: Jeyakumar V, Rubinov AM (eds) Continuous optimization: current trends and applications. Springer, New York, pp 111-144.
10. UIC (2000) Timetable recovery margins to guarantee timekeeping-recovery margins. Leaflet 451-1, Union Internationale des chémins de fer, Paris, France.
11. van Slyke R (1963) Monte Carlo methods and the PERT problem. Oper Res 11: 839-860.