An evaluation of algorithms and systems for Computer-Aided Train Dispatching

A distinctive feature of the train control process is that it is fairly easy to handle when trains are running according to their timetables and no disturbances occur, but is extremely difficult to handle in an optimal way in case of disruptions. Within this research area, one focus has been on development of models, algorithms and systems, which support optimal computer-aided train dispatching. This paper summarises an evaluation of the properties, in general and with respect to rules and conditions in Sweden, of one of the more important of the existing algorithms. We have also implemented it as a minor prototype system in order to, "off-line", evaluate its possibilities and limitations concerning the dynamic aspects of train traffic control.