TU Darmstadt / ULB / TUbiblio

Computing Joint Delay Distributions for Trains in Railway Networks

Schwierczek, Kai :
Computing Joint Delay Distributions for Trains in Railway Networks.
[Online-Edition: http://tuprints.ulb.tu-darmstadt.de/5204]
Technische Universität , Darmstadt
[Bachelorarbeit], (2016)

Offizielle URL: http://tuprints.ulb.tu-darmstadt.de/5204

Kurzbeschreibung (Abstract)

Stochastic models for delay propagation in railway networks lead to promising results in the prediction of train delays. To respect waiting time policies, while preserving efficiency, these solutions assume that the departure and arrival times of trains are stochastically independent. We show, that the inherent error can become a significant problem. To tackle this problem, we first present formulas to calculate joint delay distributions for dependent trains in a basic structure. Using these distributions we can then calculate exact distributions for connecting trains. We then present a computational study comparing our calculation to a calculation, which uses the independence assumption, on a real world timetable of the German railway network (Deutsche Bahn AG). Our results show that, in the real world timetable, the error is negligible, but we still discuss how different structures could influence the result.

Typ des Eintrags: Bachelorarbeit
Erschienen: 2016
Autor(en): Schwierczek, Kai
Titel: Computing Joint Delay Distributions for Trains in Railway Networks
Sprache: Englisch
Kurzbeschreibung (Abstract):

Stochastic models for delay propagation in railway networks lead to promising results in the prediction of train delays. To respect waiting time policies, while preserving efficiency, these solutions assume that the departure and arrival times of trains are stochastically independent. We show, that the inherent error can become a significant problem. To tackle this problem, we first present formulas to calculate joint delay distributions for dependent trains in a basic structure. Using these distributions we can then calculate exact distributions for connecting trains. We then present a computational study comparing our calculation to a calculation, which uses the independence assumption, on a real world timetable of the German railway network (Deutsche Bahn AG). Our results show that, in the real world timetable, the error is negligible, but we still discuss how different structures could influence the result.

Ort: Darmstadt
Fachbereich(e)/-gebiet(e): Fachbereich Informatik
Fachbereich Informatik > Algorithmik
Hinterlegungsdatum: 24 Jan 2016 20:55
Offizielle URL: http://tuprints.ulb.tu-darmstadt.de/5204
URN: urn:nbn:de:tuda-tuprints-52046
Gutachter / Prüfer: Weihe, Prof. Karsten
Datum der Begutachtung bzw. der mündlichen Prüfung / Verteidigung / mdl. Prüfung: 12 Juni 2013
Export:

Optionen (nur für Redakteure)

Eintrag anzeigen Eintrag anzeigen