License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2011.100
URN: urn:nbn:de:0030-drops-32705
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3270/
Go to the corresponding OASIcs Volume Portal

Berger, Annabell ; Gebhardt, Andreas ; Müller-Hannemann, Matthias ; Ostrowski, Martin

Stochastic Delay Prediction in Large Train Networks

pdf-format:
10.pdf (0.6 MB)

Abstract

In daily operation, railway traffic always deviates from the planned schedule to a certain extent. Primary initial delays of trains may cause a whole cascade of secondary delays of other trains over the entire network. In this paper, we propose a stochastic model for delay propagation and forecasts of arrival and departure events which is applicable to all kind of public transport (not only to railway traffic). Our model is fairly realistic, it includes general waiting policies (how long do trains wait for delayed feeder trains), it uses driving time profiles (discrete distributions) on travel arcs which depend on the departure time, and it incorporates the catch-up potential of buffer times on driving sections and train stops. The model is suited for an online scenario where a massive stream of update messages on the current status of trains arrives which has to be propagated through the whole network. Efficient stochastic propagation of delays has important applications in online timetable information, in delay management and train disposition, and in stability analysis of timetables.

The proposed approach has been implemented and evaluated on the German timetable of 2011 with waiting policies of Deutsche Bahn AG. A complete stochastic delay propagation for the whole German train network and a whole day can be performed in less than 14 seconds on a PC. We tested our propagation algorithm with artificial discrete travel time distributions which can be parametrized by the size of their fluctuations. Our forecasts are compared with real data. It turns out that stochastic propagation of delays is efficient enough to be applicable in practice, but the forecast quality requires further adjustments of our artificial travel time distributions to estimates from real data.

BibTeX - Entry

@InProceedings{berger_et_al:OASIcs:2011:3270,
  author =	{Annabell Berger and Andreas Gebhardt and Matthias M{\"u}ller-Hannemann and Martin Ostrowski},
  title =	{{Stochastic Delay Prediction in Large Train Networks}},
  booktitle =	{11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
  pages =	{100--111},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-33-0},
  ISSN =	{2190-6807},
  year =	{2011},
  volume =	{20},
  editor =	{Alberto Caprara and Spyros Kontogiannis},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3270},
  URN =		{urn:nbn:de:0030-drops-32705},
  doi =		{10.4230/OASIcs.ATMOS.2011.100},
  annote =	{Keywords: stochastic delay propagation, timetable information, delay management, train disposition, stability analysis}
}

Keywords: stochastic delay propagation, timetable information, delay management, train disposition, stability analysis
Collection: 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Issue Date: 2011
Date of publication: 19.09.2011

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI