Author(s)

T. Gröger

Abstract

This paper presents a new method for the simulation of the compilation process of conflict-free timetables. These are created in a similar manner to the train path management process on the basis of calculated exact blocking times and explicit conflict resolution. Nevertheless in the simulation the filling of the timetable with trains as well as the conflict resolution are executed by means of an algorithm. This simulation of timetable compilation allows us to answer classical questions about the capacity assessment of the railway infrastructure, and the validation of the new timetable and operational concepts. The improved results of the new asynchronous simulation procedure are due to a more sophisticated conflict resolution method between train movements, particularly on single track lines and in complex networks. This is achieved through the automatic choice of alternative t

Keywords