SinoTechIntel Academic Portal
Official PDF TranslationRailway Engineering Science (铁道工程科学)

Solving the Railway Timetable Rescheduling Problem with Graph Neural Networks

Authors: Ping Huang; Zihuan Peng; Zhongcan Li; Qiyuan Peng

DOI: 10.1007/s40534-025-00383-7Status: Verified Translated Edition
reCAPTCHA Bot Shield Active

Preparing Secure Academic Download

Verifying human reader & generating high-resolution document...

Verifying Document Integrity15s remaining
← Back to Article
Protected by Google reCAPTCHA v3.PrivacyTerms

Key Findings in This Report

• • The GNN-based approach predicts train dwelling and running times with satisfactory accuracy, enabling precise rescheduling decisions under delay scenarios. • • The proposed method reduces train delays by up to 20% compared to three rule-based benchmarks in disturbed train groups, demonstrating operational superiority. • • The model achieves high computational efficiency, with inference times under 1 second for real-time rescheduling scenarios, supporting practical deployment. • • The Overtaking Identification Algorithm (OIA) effectively identifies train overtaking events, enhancing the interpretability of rescheduling actions.
Download Full PDF: Solving the Railway Timetable Rescheduling Problem with Graph Neural Networks | SinoTechIntel | SinoTechIntel