Solving the railway timetable rescheduling problem with graph neural networks
Ping Huang , Zihuan Peng , Zhongcan Li , Qiyuan Peng
Railway Engineering Science ›› : 1 -22.
Solving the railway timetable rescheduling problem with graph neural networks
This study solves the train timetable rescheduling (TTR) problem from a brand-new perspective. We assume that train traffic controllers take three main actions, i.e., adjusting dwelling times, running times, and train orders, to reschedule the timetable in real-time dispatching. To raise the interpretability of rescheduling models, we propose a graph neural network (GNN) approach to map the train timetable data into evolution graphs that fit the paradigm of train operation processes. Based on graphs, two experiments from node and edge perspectives were investigated based on train operation data, i.e., (1) node experiment: train dwelling times and running times are predicted; and (2) edge experiment: an algorithm based on evolution graph, called overtaking identification algorithm (OIA), is proposed to identify train overtaking based on the consequences of the node experiment. Timetable rescheduling solutions are obtained by integrating the GNN, OIA, and train operation constraints. Experimental results show that the proposed approach has a satisfactory predictive performance. Timetable rescheduling cases under diverse delay scenarios are examined, showing that the proposed method is superior to other three standard rule-based benchmarks regarding train delays of the disturbed train groups under the given scenarios. Additionally, the model exhibits high efficiency in the three timetable rescheduling scenarios, demonstrating the model’s applicability in real-time train dispatching.
Timetable rescheduling / Timetable rescheduling actions / Graph neural networks / Evaluation graphs
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
Szpigel B (1973) Optimal train scheduling on a single line railway. |
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
Liu X, Zhou M, Ma J et al (2022) A two-stage stochastic programming approach for timetable rescheduling with reassignment of rolling stock under uncertain disruptions. In: 2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC). Macau, pp 4349–4354. |
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
Zhu Y, Wang H, Goverde RM (2020) Reinforcement learning in railway timetable rescheduling. In: 2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC). 20–23 September 2020, Rhodes |
| [40] |
|
| [41] |
|
| [42] |
|
| [43] |
|
| [44] |
|
| [45] |
|
| [46] |
|
| [47] |
|
| [48] |
Heglund JS, Taleongpong P, Hu S et al (2020) Railway Delay Prediction with Spatial-Temporal Graph Convolutional Networks. In: 2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC). 20–23 September 2020, Rhodes |
| [49] |
|
| [50] |
|
| [51] |
|
| [52] |
Jusup M, Trivella A, Corman F (2021) A review of real-time railway and metro rescheduling models using learning algorithms. In: 21st Swiss Transport Research Conference (STRC 2021). 12–14 September 2021, Ascona |
| [53] |
Velickovic P, Cucurull G, Casanova A et al (2017) Graph attention networks. In: 6th International Conference on Learning Representations, Vancouver, pp 1–12 |
The Author(s)
/
| 〈 |
|
〉 |