Train rescheduling and platforming in large high-speed railway stations

Abstract

To deal with train delays in large high-speed railway stations, a multi-objective mixed-integer nonlinear programming (MO-MINLP) optimization model was proposed. The model used the arrival time, departure time, track occupation, and route selection as the decision variables and fully considered the station infrastructure layout, train operational requirements, and time standards as limiting factors. The optimization objective was to minimize train delays and reduce track and route adjustments. To realize the large-scale and rapid solution of the MO-MINLP model, this study proposed a rolling horizon optimization algorithm that used “half an hour” as a time interval and solved the rescheduling and platforming problem of each time interval step-by-step. In numerical experiments, 227 train movements under delay circumstances in Hangzhoudong station were optimized by using the proposed model and solution algorithm. The results show that the proposed MO-MINLP model could resolve route conflicts, compress unnecessary dwell times, and reduce train delays; the solution algorithm could efficiently increase the computational speed. The maximum solution time for optimizing the 227 train movements is 15 min 24 s.