The Computational Complexity of Delay Management

  • Michael Gatto
  • Riko Jacob
  • Leon Peeters
  • Anita Schöbel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3787)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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
  2. [GGJ+04]
    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)CrossRefGoogle Scholar
  3. [GJ79]
    Garey, M., Johnson, D.: Computers and Intractability – A Guide to the Theory of NP-Completeness. Freeman and Company, New York (1979)MATHGoogle Scholar
  4. [GJPS04]
    Gatto, M., Jacob, R., Peeters, L., Schöbel, A.: The computational complexity of delay management. Technical Report 456, ETH Zurich (2004)Google Scholar
  5. [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
  6. [Hås01]
    Håstad, J.: Some optimal inapproximability results. Journal of ACM 48, 798–859 (2001)MATHCrossRefGoogle Scholar
  7. [HK81]
    Hendrickson, C., Kocur, G.: Schedule delay and departure time decisions in a deterministic model. Transportation Science 15, 62–77 (1981)CrossRefGoogle Scholar
  8. [Meg04]
    Megyeri, C.: Bicriterial delay management. Konstanzer Schriften in Mathematik und Informatik 198, University of Konstanz (2004)Google Scholar
  9. [Pol74]
    Poljak, S.: A note on the stable sets and coloring of graphs. Comment. Math. Univ. Carolin. 15, 307–309 (1974)MATHMathSciNetGoogle Scholar
  10. [PY91]
    Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)MATHCrossRefMathSciNetGoogle Scholar
  11. [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
  12. [Sch03]
    Schöbel, A.: Customer-oriented optimization in public transportation. Habilitation Thesis, University of Kaiserslautern (2003) (To appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Michael Gatto
    • 1
  • Riko Jacob
    • 1
  • Leon Peeters
    • 1
  • Anita Schöbel
    • 2
  1. 1.Institute of Theoretical Computer ScienceETH Zurich 
  2. 2.Institute for Numerical and Applied MathematicsUniversity of Göttingen 

Personalised recommendations