Reinforcement Learning for Scalable Train Timetable Rescheduling with Graph Representation
Peng Yue, Yaochu Jin, Xuewu Dai, Zhenhua Feng, Dongliang Cui

TL;DR
This paper introduces a reinforcement learning approach using graph neural networks for scalable and feasible train timetable rescheduling, improving efficiency and adaptability over traditional methods.
Contribution
It presents a novel graph-based representation, reformulates the solution construction, and develops a curriculum learning strategy for effective train timetable rescheduling.
Findings
Outperforms handcrafted rules and state-of-the-art solvers in diverse scenarios.
Handles various problem sizes and delay levels effectively.
Significantly improves solution quality with minimal additional computation.
Abstract
Train timetable rescheduling (TTR) aims to promptly restore the original operation of trains after unexpected disturbances or disruptions. Currently, this work is still done manually by train dispatchers, which is challenging to maintain performance under various problem instances. To mitigate this issue, this study proposes a reinforcement learning-based approach to TTR, which makes the following contributions compared to existing work. First, we design a simple directed graph to represent the TTR problem, enabling the automatic extraction of informative states through graph neural networks. Second, we reformulate the construction process of TTR's solution, not only decoupling the decision model from the problem size but also ensuring the generated scheme's feasibility. Third, we design a learning curriculum for our model to handle the scenarios with different levels of delay. Finally,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRailway Systems and Energy Efficiency
