Reinforcement Learning for Scalable Train Timetable Rescheduling with Graph Representation (2401.06952v1)
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, a simple local search method is proposed to assist the learned decision model, which can significantly improve solution quality with little additional computation cost, further enhancing the practical value of our method. Extensive experimental results demonstrate the effectiveness of our method. The learned decision model can achieve better performance for various problems with varying degrees of train delay and different scales when compared to handcrafted rules and state-of-the-art solvers.
- P. Zhou, L. Chen, X. Dai, B. Li, and T. Chai, “Intelligent prediction of train delay changes and propagation using rvflns with improved transfer learning and ensemble learning,” IEEE Transactions on Intelligent Transportation Systems, vol. 22, no. 12, pp. 7432–7444, 2020.
- G. Cavone, T. van den Boom, L. Blenkers, M. Dotoli, C. Seatzu, and B. De Schutter, “An mpc-based rescheduling algorithm for disruptions and disturbances in large-scale railway networks,” IEEE Transactions on Automation Science and Engineering, vol. 19, no. 1, pp. 99–112, 2020.
- V. Cacchiani, D. Huisman, M. Kidd, L. Kroon, P. Toth, L. Veelenturf, and J. Wagenaar, “An overview of recovery models and algorithms for real-time railway rescheduling,” Transportation Research Part B: Methodological, vol. 63, pp. 15–37, 2014.
- R. Cheng, Y. Song, D. Chen, and L. Chen, “Intelligent Localization of a High-Speed Train Using LSSVM and the Online Sparse Optimization Approach,” IEEE Transactions on Intelligent Transportation Systems, vol. 18, no. 8, pp. 2071–2084, Aug 2017.
- P. Pellegrini, G. Marliere, R. Pesenti, and J. Rodriguez, “RECIFE-MILP: An Effective MILP-Based Heuristic for the Real-Time Railway Traffic Management Problem,” IEEE Transactions on Intelligent Transportation Systems, vol. 16, no. 5, pp. 2609–2619, Oct 2015.
- M. Dotoli, N. Epicoco, M. Falagario, B. Turchiano, G. Cavone, and A. Convertini, “A Decision Support System for real-time rescheduling of railways,” in 2014 European Control Conference (ECC), Jun 2014, pp. 696–701.
- W. Fang, S. Yang, and X. Yao, “A survey on problem models and solution approaches to rescheduling in railway networks,” IEEE Transactions on Intelligent Transportation Systems, vol. 16, no. 6, pp. 2997–3016, 2015.
- J. Rodriguez, “A constraint programming model for real-time train scheduling at junctions,” Transportation Research Part B: Methodological, vol. 41, no. 2, pp. 231–245, 2007.
- K. Sato, K. Tamura, and N. Tomii, “A MIP-based timetable rescheduling formulation and algorithm minimizing further inconvenience to passengers,” Journal of Rail Transport Planning & Management, vol. 3, no. 3, pp. 38–53, Aug 2013.
- B. Kersbergen, T. van den Boom, and B. De Schutter, “Distributed model predictive control for railway traffic management,” Transportation Research Part C: Emerging Technologies, vol. 68, pp. 462–489, 2016.
- C. Zhang, Y. Gao, L. Yang, Z. Gao, and J. Qi, “Joint optimization of train scheduling and maintenance planning in a railway network: A heuristic algorithm using Lagrangian relaxation,” Transportation Research Part B: Methodological, vol. 134, pp. 64–92, Apr 2020.
- Y.-H. Min, M.-J. Park, S.-P. Hong, and S.-H. Hong, “An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway network,” Transportation Research Part B: Methodological, vol. 45, no. 2, pp. 409–429, 2011.
- S. Zhan, S. Wong, P. Shang, Q. Peng, J. Xie, and S. Lo, “Integrated railway timetable rescheduling and dynamic passenger routing during a complete blockage,” Transportation Research Part B: Methodological, vol. 143, pp. 86–123, Jan 2021.
- A. Bettinelli, A. Santini, and D. Vigo, “A real-time conflict solution algorithm for the train rescheduling problem,” Transportation Research Part B: Methodological, vol. 106, pp. 237–265, Dec 2017.
- J. Törnquist Krasemann, “Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances,” Transportation Research Part C: Emerging Technologies, vol. 20, no. 1, pp. 62–78, Feb 2012.
- S. Dündar and İ. Şahin, “Train re-scheduling with genetic algorithms and artificial neural networks for single-track railways,” Transportation Research Part C: Emerging Technologies, vol. 27, pp. 1–15, 2013.
- S. Kanai, K. Shiina, S. Harada, and N. Tomii, “An optimal delay management algorithm from passengers’ viewpoints considering the whole railway network,” Journal of Rail Transport Planning & Management, vol. 1, no. 1, pp. 25–37, 2011.
- M. Wang, L. Wang, X. Xu, Y. Qin, and L. Qin, “Genetic algorithm-based particle swarm optimization approach to reschedule high-speed railway timetables: a case study in china,” Journal of Advanced Transportation, vol. 2019, 2019.
- P. Wang, L. Ma, R. M. P. Goverde, and Q. Wang, “Rescheduling Trains Using Petri Nets and Heuristic Search,” IEEE Transactions on Intelligent Transportation Systems, vol. 17, no. 3, pp. 726–735, Mar 2016.
- W. Fang, S. Yang, and X. Yao, “A Survey on Problem Models and Solution Approaches to Rescheduling in Railway Networks,” IEEE Transactions on Intelligent Transportation Systems, vol. 16, no. 6, pp. 2997–3016, Dec 2015.
- D. Šemrov, R. Marsetič, M. Žura, L. Todorovski, and A. Srdic, “Reinforcement learning approach for train rescheduling on a single-track railway,” Transportation Research Part B: Methodological, vol. 86, pp. 250–267, Apr 2016.
- W. Li and S. Ni, “Train timetabling with the general learning environment and multi-agent deep reinforcement learning,” Transportation Research Part B: Methodological, vol. 157, pp. 230–251, Mar 2022.
- H. Khadilkar, “A scalable reinforcement learning algorithm for scheduling railway lines,” IEEE Transactions on Intelligent Transportation Systems, vol. 20, no. 2, pp. 727–736, 2018.
- Y. Zhu, H. Wang, and R. M. Goverde, “Reinforcement Learning in Railway Timetable Rescheduling,” in 2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC), 2020, pp. 1–6.
- Y. Wang, Y. Lv, J. Zhou, Z. Yuan, Q. Zhang, and M. Zhou, “A policy-based reinforcement learning approach for high-speed railway timetable rescheduling,” in 2021 IEEE International Intelligent Transportation Systems Conference (ITSC), 2021, pp. 2362–2367.
- L. Ning, Y. Li, M. Zhou, H. Song, and H. Dong, “A deep reinforcement learning approach to high-speed train timetable rescheduling under disturbances,” in 2019 IEEE Intelligent Transportation Systems Conference (ITSC), 2019, pp. 3469–3474.
- P. Yue, Y. Jin, X. Dai, Z. Feng, and D. Cui, “Reinforcement learning for online dispatching policy in real-time train timetable rescheduling,” IEEE Transactions on Intelligent Transportation Systems, 2023.
- W. Kool, H. Van Hoof, and M. Welling, “Attention, learn to solve routing problems!” arXiv preprint arXiv:1803.08475, 2018.
- I. Bello, H. Pham, Q. V. Le, M. Norouzi, and S. Bengio, “Neural Combinatorial Optimization with Reinforcement Learning,” 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, pp. 1–15, nov 2016.
- A. Hottung, Y.-D. Kwon, and K. Tierney, “Efficient active search for combinatorial optimization problems,” arXiv preprint arXiv:2106.05126, 2021.
- K. Zhang, F. He, Z. Zhang, X. Lin, and M. Li, “Multi-vehicle routing problems with soft time windows: A multi-agent reinforcement learning approach,” Transportation Research Part C: Emerging Technologies, vol. 121, p. 102861, 2020.
- Y. Zhu, B. Mao, Y. Bai, and S. Chen, “A bi-level model for single-line rail timetable design with consideration of demand and capacity,” Transportation Research Part C: Emerging Technologies, vol. 85, pp. 211–233, 2017.
- K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” arXiv preprint arXiv:1810.00826, 2018.
- C. Zhang, W. Song, Z. Cao, J. Zhang, P. S. Tan, and X. Chi, “Learning to dispatch for job shop scheduling via deep reinforcement learning,” in Advances in Neural Information Processing Systems, vol. 33, 2020, pp. 1621–1632.
- Y. Wang, A. D’Ariano, J. Yin, L. Meng, T. Tang, and B. Ning, “Passenger demand oriented train scheduling and rolling stock circulation planning for an urban rail transit line,” Transportation Research Part B: Methodological, vol. 118, pp. 193–227, 2018.
- P. R. d. O. da Costa, J. Rhuggenaath, Y. Zhang, and A. Akcay, “Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning,” in Proceedings of The 12th Asian Conference on Machine Learning, vol. 129, Nov 2020, pp. 465–480.
- “Gurobi optimizer reference manual,” http://www.gurobi.com., 2022.
- F. Corman, A. D’Ariano, D. Pacciarelli, and M. Pranzo, “A tabu search algorithm for rerouting trains during rail operations,” Transportation Research Part B: Methodological, vol. 44, no. 1, pp. 175–192, Jan 2010.