Probabilistic Simulation of a Railway Timetable

DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

Abstract

Railway systems are often highly utilized, which makes them vulnerable to delay propagation. In order to minimize delays timetables are desired to be robust, a property that is often estimated by simulating the respective timetable for different deterministic delay values. To achieve an accurate estimation under consideration of uncertain delays many simulation runs need to be executed. Most established simulation systems additionally use microscopic models of the railway systems, which further increases the simulations running times and makes them applicable rather for small areas of interest for complexity reasons. In this paper, we present a probabilistic, symbolic simulation algorithm for given timetables, this means we do not simulate individual executions, but all possible executions at once. We use a macroscopic model of the railway infrastructure as input. This way we consider the railway systems in less detail but are able to examine certain performance indicators for larger areas. For a given input model this simulation computes exact results. We implement the algorithm, examine its results, and discuss possible improvements of this approach.

Authors 3

1. Rebecca Haehn Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, LuFG THS, Germany

   RWTH Aachen University, Aachen, Germany

2. Erika Ábrahám Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, LuFG THS, Germany

   RWTH Aachen University, Aachen, Germany

3. Nils Nießen Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University, VIA, Germany

   RWTH Aachen University, Aachen, Germany