Abstract
This paper proposes a comprehensive approach for the railway scheduling problem, which starts with the commercial description of intended train services and has the goal of generating a conflict-free detailed schedule. The approach consists of three description levels with their corresponding interfaces and enables a hierarchical divide-and-conquer approach. The first step is the description of a formal structure for describing the service intention, including periodicity information. A projection scheme is used to create an augmented periodic problem. This augmented periodic timetabling problem is solved first globally on an aggregated topology and simplified safety model, and subsequently refined locally by considering all details of the infrastructure and train dynamics. Finally, the generated periodic conflict-free schedule is rolled out over the complete day to create a production plan fulfilling all requirements specified in the service intention.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G. Caimi. Algorithmic decision support for train scheduling in a large and highly utilised railway network. PhD thesis, ETH Zurich, 2009.
G. Caimi, F. Chudak, M. Fuchsberger, M. Laumanns, and R. Zenklusen. A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling. Transportation Science, 2010. Article in Advance.
L. G. Kroon, D. Huisman, E. Abbink, P.-J. Fioole, M. Fischetti, G. Maroti, A. Schrijver, A. Steenbeek, and R. Ybema. The New Dutch Timetable: The OR Revolution. INTERFACES, 39(1): 6–17, 2009.
P. Serafini and W. Ukovich. A mathematical model for periodic scheduling problems. SIAM J. Disc. Math., 2(4): 550–581, 1989.
P. J. Zwaneveld, L. G. Kroon, H. E. Romeijn, M. Salomon, S. Dauzère-Pérès, S. P. M. van Hoesel, and H. W. Ambergen. Routing Trains through Railway Stations: Model Formulation and Algorithms. Transportation Science, 30(3): 181–194, August 1996.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caimi, G. (2011). Train Scheduling in a Large and Highly Utilised Railway Network. In: Hu, B., Morasch, K., Pickl, S., Siegle, M. (eds) Operations Research Proceedings 2010. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20009-0_104
Download citation
DOI: https://doi.org/10.1007/978-3-642-20009-0_104
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20008-3
Online ISBN: 978-3-642-20009-0
eBook Packages: Business and EconomicsBusiness and Management (R0)