In high-speed railways, the sunset-departure and sunrise-arrival trains (SDSA-trains) have become the primary choice of many inter-city travelers. However, optimization of SDSA-trains is very challenging due to the consideration of regular maintenance at night in high-speed railways. By considering the disturbances of maintenance activities in real-world, this paper proposes a two-stage stochastic programming model to optimize a robust train scheduling for SDSA-trains. Specifically, in the first stage, we aim to decide the departure time from the origin and the arrival time at destination station for SDSA-trains, while minimizing the total arrival time. In the second stage, we consider the maintenance disturbances to generate a robust train schedule by adjusting the stop patterns, train orders, and the assignment of tracks. Some linearization techniques are used for the nonlinear constraints. Finally, a real-world instance based on the Beijing-Guangzhou high-speed railway corridors is conducted to show the effectiveness of our approach.
A Robust Optimization Approach for Trains Schedule Problem under Uncertain Maintenance Plans
08.10.2022
379489 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Simultaneous schedule of trains and track maintenance according to stochastic blockage time
Taylor & Francis Verlag | 2022
|Optimum assignment of trains to platforms under partial schedule compliance
Online Contents | 2008
|SNCF plans new trains and routes
British Library Online Contents | 2003