Abstract
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If there is a single delayed train and passengers transfer at most twice along fixed routes, or if the railway network has a tree structure, the problem can be solved by reduction to min-cut problems. For delayed passenger flows on a railway network with a path structure, the problem can be solved to optimality by dynamic programming. If passengers are allowed to adapt their route to the waiting policy, the decision problem is strongly \(\mathcal{NP}\)-complete.
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.
References
Anderegg, L., Penna, P., Widmayer, P.: Online train disposition: to wait or not to wait? In: Wagner, D. (ed.) Electronic Notes in Theoretical Computer Science, vol. 66, Elsevier, Amsterdam (2002)
Gatto, M., Glaus, B., Jacob, R., Peeters, L., Widmayer, P.: Railway delay management: Exploring its algorithmic complexity. Technical Report 441, ETH Zurich, Institute for Theoretical Computer Science (2004)
Goverde, R.: Optimal scheduling of connections in railway systems. Technical report, TRAIL, Delft, The Netherlands (1998)
Goverde, R.: Transfer stations and synchronization. Technical report, TRAIL, Delft, The Netherlands (1999)
Heimburger, D., Herzenberg, A., Wilson, N.: Using simple simulation models in the operational analysis of rail transit lines: A case study of the MBTA’s red line. Transportation Research Record 1677, 21–30 (1999)
Mansilla, S.: Report on disposition of trains. Technical report, ETH Zurich (2001)
Nachtigall, K.: Periodic Network Optimization and Fixed Interval Timetables. Habilitation Thesis, Braunschweig, Germany (1998)
O’Dell, S., Wilson, N.: Optimal real-time control strategies for rail transit operations during disruptions. In: Computer-Aided Transit Scheduling. Lecture Notes in Economics and Math. Sys., pp. 299–323. Springer- Verlag, Heidelberg (1999)
Schöbel, A.: A model for the delay management problem based on mixedinteger- programming. In: Zaroliagis, C. (ed.) Electronic Notes in Theoretical Computer Science, vol. 50, Elsevier, Amsterdam (2001)
Schöbel, A.: Customer-oriented optimization in public transportation. Habilitation Thesis, Universität Kaiserslautern (2002) (to appear)
Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences 26(3), 362–391 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gatto, M., Glaus, B., Jacob, R., Peeters, L., Widmayer, P. (2004). Railway Delay Management: Exploring Its Algorithmic Complexity. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-27810-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22339-9
Online ISBN: 978-3-540-27810-8
eBook Packages: Springer Book Archive