Grégory Marlière
Univ. Lille Nord de France, F-59000 Lille, IFSTTAR, COSYS, ESTAS, F-59650 Villeneuve d’Ascq, France
Sonia Sobieraj Richard
Univ. Lille Nord de France, F-59000 Lille, IFSTTAR, COSYS, ESTAS, F-59650 Villeneuve d’Ascq, France
Paola Pellegrini
Univ. Lille Nord de France, F-59000 Lille, IFSTTAR, COSYS, LEOST, F-59650 Villeneuve d’Ascq, France
Joaquin Rodriguez
Univ. Lille Nord de France, F-59000 Lille, IFSTTAR, COSYS, ESTAS, F-59650 Villeneuve d’Ascq, France
Download articlePublished in: RailNorrköping 2019. 8th International Conference on Railway Operations Modelling and Analysis (ICROMA), Norrköping, Sweden, June 17th – 20th, 2019
Linköping Electronic Conference Proceedings 69:57, p. 877-896
Published: 2019-09-13
ISBN: 978-91-7929-992-7
ISSN: 1650-3686 (print), 1650-3740 (online)
This paper tackles the real-time Railway Traffic Management Problem (rtRTMP). It is the problem of finding an optimal choice for the train schedules and routes to reduce the delays of trains due to conflicts. We present a new formulation of the rtRTMP. This new formulation is based on a previously proposed one that models railway traffic at a microscopic level with optional activities using a Constraint Based Scheduling (CBS) approach. To ease the modelling of optional activities, a new concept based on a tree data structure and a specific filtering algorithm was extended through the introduction of conditional time-interval variables in Ilog CP-optimizer library. The new formulation of the rtRTMP presented in this paper exploits the conditional time-interval variables. The formulation has been vali-dated with experiments on a large set of instances. The experimental results demonstrate the effectiveness of this new CBS model and show its good performance compared with the state-of-the art RECIFE-MILP algorithm.
Real Time Traffic Management, Train Dispatching Problem, Re-routing and re-scheduling trains, Minimize secondary delays, Constraint Propagation