In real life operation, trains almost always suffer from disturbances. It is the job of the
train dispatcher to resolve conflicts that occur when trains deviate from the planned
timetable. In synchronous simulation of timetables with disturbances, the functionality of
the train dispatcher needs to be modelled, Siefer (2008). This is the task of the dispatching
algorithm. The algorithm in this paper solves potential conflicts by evaluating the impact
of changing train order at stations, i.e. overtakings, on travel time. This is done starting
with the first station on the line progressing from the first to the last train arriving at that
station. When all trains are scheduled at one station, the algorithm proceeds to the next.
Thus it is not completely the same as a time-based synchronous simulation where
conflicts are solved in chronological order. Figure 3 shows a flowchart of the procedure.