A resource-oriented decomposition approach for train timetabling problem with variant running time and minimum headway
- 23 September 2020
- journal article
- research article
- Published by Taylor & Francis in Transportation Letters
- Vol. 14 (2) , 129-142
Abstract
Solving the practical train timetabling problem under complex real-life train operation environment is challenging. This article addresses the train timetabling problem considering the variant parameters (i.e. running time and minimum headway) depending on stop-decisions. Based on a resource-oriented decomposition representation of safety headway, the train timetabling is modeled by cumulative flow variables considering the variant parameters depending on stop-decisions. A Lagrangian relaxation-based approach (LR) is used to decompose the combinatorial train timetabling problem into train-independent shortest path sub-problems, which can be solved simultaneously by parallel computation by relaxing the capacity constraint. A capacity assessment-based heuristic is proposed for improving the feasibility reparing of LR solutions. The solution quality and efficiency are analyzed employing the real-life operational data of Wuhan to Guangzhou high-speed railway in China. The benefits of the improved heuristic and parallel computation are demonstrated in contrast with the existed approach.Keywords
Funding Information
- National Key R&D Program of China (2018YFB1201403)
This publication has 37 references indexed in Scilit:
- A model predictive control approach for discrete-time rescheduling in complex central railway station areasComputers & Operations Research, 2012
- Bi-objective conflict detection and resolution in railway traffic managementTransportation Research Part C: Emerging Technologies, 2012
- Railway crew rescheduling with retimingTransportation Research Part C: Emerging Technologies, 2012
- Scheduling extra freight trains on railway networksTransportation Research Part B: Methodological, 2010
- SCHEDULING A HETEROGENEOUS SET OF TRAINS OVER A SINGLE LINE TRACK USING LAGRANGIAN RELAXATIONThe ANZIAM Journal, 2008
- A branch and bound algorithm for scheduling trains in a railway networkEuropean Journal of Operational Research, 2007
- Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower boundsTransportation Research Part B: Methodological, 2007
- A Model, Algorithms and Strategy for Train PathingJournal of the Operational Research Society, 1995
- Extending a train pathing model from one-way to two-way trackTransportation Research Part B: Methodological, 1994
- Parallel Lagrangian relaxation in power schedulingComputing Systems in Engineering, 1992