Propagation-Based Train Rescheduling under Recoverable Delay Disturbances

Abstract

Real-time train rescheduling for high-speed railway (HSR) is a pivotal technique in HSR transportation to efficiently recover train operation under disturbance scenarios. This paper aims to put forward an integrated resolving and rescheduling method considering network delay propagation. A tree-based conflict resolution mechanism is first established, with delicate considerations on the strategy’s adaptability under different conflict scenarios. By inputting the scheduled arrival and departure time under different conflict resolution strategies, the timetable optimizing model aims to look for an optimal solution with minimal weighted train delay and average train adjustments under necessary technical and empirical constraints solved by a combined algorithm of Pareto optimality and Nash equilibrium, where the feasible solution space is narrowed in advance by a depth-first pruning algorithm. The performance of this coordinated train rescheduling approach is validated by a typical section disturbance in a regional HSR network administrated by the Shanghai Bureau. The results show that the proposed method can well utilizes timetable buffers and organizes train avoidance. The delay propagation characteristics are also simultaneously estimated based on the indicators of cumulative delay and instantaneous delay, which are established considering the spatio-temporal difference between the scheduled and planned timetables, in order to verify the coordination between resolution strategies and train running delays.