Graph learning-assisted logic-based Benders decomposition for distributionally robust in-station train rescheduling under disruptions
Xiaobin Li, Yanbin Gao, Jianing Long, Wuming Lei
原文摘要
Resource closures, arrival delays, and processing-time extensions jointly alter station operations during disruptions. Uncertain reopening times further complicate decisions about holding trains and selecting alternative routes. We use observations of disruption-resolution stages to update conditional predictions of the remaining closure duration. A distributionally robust model accounts for errors in scenario probability estimates and jointly optimizes train routes, sequences, and timings. Logic-based Benders decomposition coordinates routing and resource scheduling. Conditional cuts exploit resource-use patterns, and a graph neural network guides the solution order of resource relaxations. Together, these components form the GNN-LBBD algorithm. Across 28 test instances for a five-track station, GNN-LBBD achieved a mean total completion delay of 61.13 train-min. This was 16.63% lower than tabu search and 20.06% lower than variable neighborhood search. Its mean total computation time was close to that of tabu search. On six representative instances, using stage observations reduced mean total completion delay by approximately 21.7%. Continued updating of reopening-time predictions allows route and entry-time adjustments during closures, reducing delays caused by waiting for reopening.
cs.AI