Creating timetables in case for disturbances in simulation of railroad traffic
In this paper a traffic-control algorithm is designed that creates a feasible traffic plan when normal schedules are somehow disturbed in a train traffic simulation environment. The main questions That are handled in this algorithm are: (1) when must the decision be made to make a new traffic plan? and (2) How to create the new traffic plan? First conflict probabilities are introduced to model the timing of the new traffic plan. Next a method is presented to create a new traffic plan in case of small disturbances, based on finding a maximum weighted clique in a graph. The presented algorithm works fast enough to be used in simulation.
To reference this document use:
PNS - Performance of Networks & Systems
TS - Technical Sciences
Train traffic control
Proceedings of the 45th International Conference on Computers & Industrial Engineering (CIE45), Metz, France, 28-30 october 2015, 1-8