Advertisement

Modelling Delay Propagation in Railway Networks

  • Fabian KirchhoffEmail author
Conference paper
Part of the Operations Research Proceedings book series (ORP)

Abstract

In this paper we study the accumulation and propagation of delays in (simplified) railway networks. More precisely, we want to estimate the total expected arrival delay of passengers as a cost criterion to be used in a timetable optimisation. Therefore, we want to determine the delay distributions analytically from given source delay distributions. In order to include accumulation and propagation of delays, the source delay distribution must belong to a family of distributions that is closed under appropriate operations. This is the case if we can represent the distribution functions by so called theta-exponential polynomials. A drawback of this representation is the increasing number of parameters needed to describe the results of the operations. A combination with moment approximations allows to solve this problem with sufficient accuracy. Generally, the calculation of propagated delays requires a topological sorting of arrival and departure events. That excludes cyclic structures in the network. We present a relaxation of the topological sorting that allows to (approximately) calculate long run delays in cycles.

Keywords

Delay Propagation Cyclic Structure Modelling Delay Railway Network Delay Distribution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Berger, A., Gebhardt, A., Mueller-Hannemann, M., & Ostrowski, M. (2011). Stochastic delay prediction in large train networks. ATMOS, 20, 100–111.Google Scholar
  2. 2.
    Bueker, T. (2010). Ausgewaehlte Aspekte der Verspaetungsfortpflanzung in Netzen. Dissertation, RWTH Aachen University.Google Scholar
  3. 3.
    Johnson, M. (1993). Selecting parameters of phase distributions: Combining nonlinear programming, heuristics, and erlang distributions. ORSA Journal on Computing, 5, 69–83.CrossRefGoogle Scholar
  4. 4.
    Johnson, M., & Taaffe, M. (1989). Matching moments to phase distributions: Mixtures of erlang distributions of common order. Stochastic Models, 5, 711–743.CrossRefGoogle Scholar
  5. 5.
    Meester, L. E., & Muns, S. (2007). Stochastic delay propagation in railway networks and phase-type distributions. Transportation Research, 41, 218–230.CrossRefGoogle Scholar
  6. 6.
    Thuemmler, A., Buchholz, P., & Telek, M. (2006). A novel approach for phase-type fitting with the EM algorithm. IEEE Transactions on Dependable and Secure Computing, 3, 245–258.Google Scholar
  7. 7.
    Trogemann, G., & Gent, M. (1997). Performance analysis of parallel programs based on directed acyclic graphs. Acta Informatica, 34, 411–428.Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Institute of Applied Stochastics and Operations ResearchClausthal-ZellerfeldGermany

Personalised recommendations