TY - GEN
T1 - Timetable Rescheduling for High-Speed Trains Based on a Multi-Agent Game Reinforcement Learning Method
AU - Zhou, Xiaomin
AU - Zhou, Min
AU - Cui, Junfeng
AU - Song, Haifeng
AU - Dong, Hairong
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - As the high-speed rail network grows, unexpected disruptions affecting train operations have become increasingly common. Consequently, efficiently adjusting train schedules to minimize delays has become a critical challenge in high-speed rail timetable rescheduling (TTR). To address this issue, this paper proposes a Multi-Agent Game Deep Reinforcement Learning (MAGDRL) approach to tackle the TTR problem during a complete blockage. Initially, the paper defines the MAGDRL state and action spaces, incorporating spatiotemporal distribution information, and develops an effective reward feedback system. Next, the Nash-Q learning algorithm ensures convergence to the Nash equilibrium strategy. Additionally, an approximate Nash equilibrium solving method is applied to enhance the computational efficiency of determining the Nash equilibrium strategy. Finally, simulation results based on the Beijing-Shanghai high-speed railway demonstrate that the proposed method effectively handles timetable rescheduling across multiple disruption scenarios involving complete blockages of segments.
AB - As the high-speed rail network grows, unexpected disruptions affecting train operations have become increasingly common. Consequently, efficiently adjusting train schedules to minimize delays has become a critical challenge in high-speed rail timetable rescheduling (TTR). To address this issue, this paper proposes a Multi-Agent Game Deep Reinforcement Learning (MAGDRL) approach to tackle the TTR problem during a complete blockage. Initially, the paper defines the MAGDRL state and action spaces, incorporating spatiotemporal distribution information, and develops an effective reward feedback system. Next, the Nash-Q learning algorithm ensures convergence to the Nash equilibrium strategy. Additionally, an approximate Nash equilibrium solving method is applied to enhance the computational efficiency of determining the Nash equilibrium strategy. Finally, simulation results based on the Beijing-Shanghai high-speed railway demonstrate that the proposed method effectively handles timetable rescheduling across multiple disruption scenarios involving complete blockages of segments.
KW - Multi-agent game reinforcement learning
KW - Nash equilibrium
KW - Nash-Q learning
KW - Timetable rescheduling
UR - https://www.scopus.com/pages/publications/105004170927
U2 - 10.1109/ICIT63637.2025.10965300
DO - 10.1109/ICIT63637.2025.10965300
M3 - 会议稿件
AN - SCOPUS:105004170927
T3 - Proceedings of the IEEE International Conference on Industrial Technology
BT - 2025 International Conference on Industrial Technology, ICIT 2025 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 26th International Conference on Industrial Technology, ICIT 2025
Y2 - 26 March 2025 through 28 March 2025
ER -