Abstract
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.
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
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)
Gatto, M., Glaus, B., Jacob, R., Peeters, L., Widmayer, P.: Railway delay management: Exploring its algorithmic complexity. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 199–211. Springer, Heidelberg (2004)
Garey, M., Johnson, D.: Computers and Intractability – A Guide to the Theory of NP-Completeness. Freeman and Company, New York (1979)
Gatto, M., Jacob, R., Peeters, L., Schöbel, A.: The computational complexity of delay management. Technical Report 456, ETH Zurich (2004)
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)
Håstad, J.: Some optimal inapproximability results. Journal of ACM 48, 798–859 (2001)
Hendrickson, C., Kocur, G.: Schedule delay and departure time decisions in a deterministic model. Transportation Science 15, 62–77 (1981)
Megyeri, C.: Bicriterial delay management. Konstanzer Schriften in Mathematik und Informatik 198, University of Konstanz (2004)
Poljak, S.: A note on the stable sets and coloring of graphs. Comment. Math. Univ. Carolin. 15, 307–309 (1974)
Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)
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)
Schöbel, A.: Customer-oriented optimization in public transportation. Habilitation Thesis, University of Kaiserslautern (2003) (To appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gatto, M., Jacob, R., Peeters, L., Schöbel, A. (2005). The Computational Complexity of Delay Management. In: Kratsch, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2005. Lecture Notes in Computer Science, vol 3787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604686_20
Download citation
DOI: https://doi.org/10.1007/11604686_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31000-6
Online ISBN: 978-3-540-31468-4
eBook Packages: Computer ScienceComputer Science (R0)