Intelligent Train Timetable Generation Technology Based on Monte Carlo Tree Search Algorithm
Promet - Traffic&Transportation · 29.01.2026 · 38 (1) · 169-185
DOI: 10.7307/ptt.v38i1.1201 ↗Kurz gefasst
Fachartikel in der Zeitschrift Promet - Traffic&Transportation, online erschienen am 29.01.2026. Verfasst von Junyuan HE und 5 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
This paper presents an innovative approach to train timetable generation using Monte Carlo tree search (MCTS) integrated with a deep reinforcement learning technique. The generation and adjustment of train timetables for high-speed railways represent a complex optimisation problem with numerous rule-based constraints that traditional mathematical methods struggle to solve efficiently. Therefore, the train timetable generation problem is modelled as a discrete spatiotemporal Markov decision process, and a comprehensive MCTS-based algorithm is developed to effectively balance exploration and exploitation through a structured tree search mechanism. The result of the comparative analysis demonstrates that MCTS-based algorithms significantly outperform state-of-the-art reinforcement learning algorithms, including double deep Q-network (DDQN) and proximal policy optimisation (PPO), achieving optimal solutions 6.5 times faster with superior training stability. To validate the scalability and real-world applicability, a large-scale case study involving 120 pairs of trains on the Beijing-Shanghai High-Speed Rail corridor over an 18-hour period successfully resolved all 45,600 initial conflicts. The optimised timetables yield significant operational improvements, including a 16.4% reduction in average delay time, 22.8% improvement in track utilisation efficiency and 9.7% reduction in energy consumption. This research contributes to the advancement of intelligent railway operations optimisation and demonstrates the potential of MCTS-based approaches to transform complex transportation problems.
Zitieren
APA
HE, J., ZHONG, Z., LI, B., FAN, J., DING, J., & CHEN, W. (2026). Intelligent Train Timetable Generation Technology Based on Monte Carlo Tree Search Algorithm. Promet - Traffic&Transportation, 38(1), 169-185. https://doi.org/10.7307/ptt.v38i1.1201
Vancouver
HE J, ZHONG Z, LI B, FAN J, DING J, CHEN W. Intelligent Train Timetable Generation Technology Based on Monte Carlo Tree Search Algorithm. Promet - Traffic&Transportation. 2026;38(1):169-185. doi:10.7307/ptt.v38i1.1201
BibTeX
@article{HE2026,
author = {HE, Junyuan and ZHONG, Zhangdui and LI, Bo and FAN, Jiaming and DING, Jianwen and CHEN, Wei},
title = {Intelligent Train Timetable Generation Technology Based on Monte Carlo Tree Search Algorithm},
journal = {Promet - Traffic&Transportation},
year = {2026},
volume = {38},
number = {1},
pages = {169--185},
doi = {10.7307/ptt.v38i1.1201}
}
EUVIMED