In high-speed railway operations, a trip sequence plan is made once the timetable is determined, and serves as a reference in the subsequent operations of train units scheduling. In light of the maintenance requirements of train units and periodicity characteristics of trip sequences, we introduce a trip sequence graph to describe the train units’ movement and coupling/splitting in a railway network. Based on the trip sequence graph, two integer linear programming models are then formulated, namely a path-based model and an arc-based model. Integrated with the characteristics of the trip sequence graph, a customized branch-and-price algorithm is developed to solve the path-based model. The two models are applied to the high-speed railway network in eastern China, and through numerical experiments, the effectiveness and applicability of the models are discussed.

Additional Metadata
Keywords Branch-and-price algorithm, High-speed railway, Maintenance, Train units scheduling, Trip sequence planning
Persistent URL dx.doi.org/10.1016/j.omega.2019.102150, hdl.handle.net/1765/121866
Journal Omega
Citation
Gao, Y. (Yuan), Schmidt, M.E, Yang, L. (Lixing), & Gao, Z. (Ziyou). (2019). A branch-and-price approach for trip sequence planning of high-speed train units. Omega. doi:10.1016/j.omega.2019.102150