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 NP-complete. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Gatto, M., Glaus, B., Jacob, R., Peeters, L., & Widmayer, P. (2004). Railway delay management: Exploring its algorithmic complexity. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3111, 199–211. https://doi.org/10.1007/978-3-540-27810-8_18
Mendeley helps you to discover research relevant for your work.