The Computational Complexity of Delay Management
Delay management for public transport consists of deciding whether vehicles should wait for delayed transferring passengers, with the objective of minimizing the overall passenger discomfort.
This paper classifies the computational complexity of delay management problems with respect to various structural parameters, such as the maximum number of passenger transfers, the graph topology, and the capability of trains to reduce delays. Our focus is to distinguish between polynomially solvable and NP-complete problem variants. To that end, we show that even fairly restricted versions of the delay management problem are hard to solve.
Unable to display preview. Download preview PDF.
- [BS04]Biederbick, C., Suhl, L.: Improving the quality of railway dispatching tasks via agent-based simulation. In: Computers in Railways IX, pp. 785–795. WIT Press, Southampton (2004)Google Scholar
- [GJPS04]Gatto, M., Jacob, R., Peeters, L., Schöbel, A.: The computational complexity of delay management. Technical Report 456, ETH Zurich (2004)Google Scholar
- [GJPW04]Gatto, M., Jacob, R., Peeters, L., Widmayer, P.: On-line delay management on a single line. In: Proc. Algorithmic Methods and Models for Optimization of Railways (ATMOS), LNCS. Springer, Heidelberg (2004) (To appear)Google Scholar
- [Meg04]Megyeri, C.: Bicriterial delay management. Konstanzer Schriften in Mathematik und Informatik 198, University of Konstanz (2004)Google Scholar
- [Sch01]Schöbel, A.: A model for the delay management problem based on mixed-integer-programming. In: Zaroliagis, C. (ed.). Electronic Notes in Theoretical Computer Science, vol. 50. Elsevier, Amsterdam (2001)Google Scholar
- [Sch03]Schöbel, A.: Customer-oriented optimization in public transportation. Habilitation Thesis, University of Kaiserslautern (2003) (To appear)Google Scholar