Railway rescheduling is the task of restoring feasibility in case of disturbances and limiting the propagation of delays through a railway network. This task becomes more difficult when dealing with complex interlocking areas, since operational rules constrain the passage of trains through short track sections. This paper presents a detailed microscopic representation of the railway network that is able to tackle the complexity of a station area with multiple conflicting routes and high service frequency. Two alternative graph formulations are presented to model the incompatibility between routes: one based on track sections and another based on the aggregation of track sections into station routes. An extensive computational study gives useful information on the performance of the two formulations for different disturbance scenarios. © 2009 Springer-Verlag Berlin Heidelberg.
Corman, F., Goverde, R. M. P., & D’Ariano, A. (2009). Rescheduling dense train traffic over complex station interlocking areas. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5868 LNCS, pp. 369–386). https://doi.org/10.1007/978-3-642-05465-5_16