Joint optimization of train scheduling and maintenance planning in a railway network: A heuristic algorithm using Lagrangian relaxation

•Propose a joint optimization model for train scheduling and maintenance planning in a railway network.•Develop a heuristic algorithm using Lagrangian relaxation to solve the ILP model.•Apply the proposed model and algorithm to a practical problem in the Chinese railway network. Train scheduling and...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Transportation research. Part B: methodological Ročník 134; s. 64 - 92
Hlavní autoři: Zhang, Chuntian, Gao, Yuan, Yang, Lixing, Gao, Ziyou, Qi, Jianguo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Elsevier Ltd 01.04.2020
Elsevier Science Ltd
Témata:
Algorithms
Computer applications
Heuristic methods
High speed rail
Lagrangian relaxation
Maintenance
Maintenance planning
Optimization
Rail transportation
Railroads
Railway network
Railway networks
Scheduling
Timetables
Train scheduling
Railway network
Train scheduling
Lagrangian relaxation
Maintenance planning
ISSN:0191-2615, 1879-2367
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Propose a joint optimization model for train scheduling and maintenance planning in a railway network.•Develop a heuristic algorithm using Lagrangian relaxation to solve the ILP model.•Apply the proposed model and algorithm to a practical problem in the Chinese railway network. Train scheduling and maintenance planning compete for the resources in a railway network. A commonly used way is dealing with maintenance planning first and then train scheduling, or vice versa. In this paper, we propose a joint optimization model for the two problems in a railway network with double-track, where the upstream and downstream trains are independent and a maintenance task on a section cannot be split or disrupted. In order to solve the model, a heuristic algorithm using Lagrangian relaxation is developed. Due to the large number of constraints, we use a dynamic constraint-generation technique in the iterations of the sub-gradient optimization procedure. We apply the model and algorithm to a practical problem in the Chinese railway network, in which some additional trains are inserted into a fixed existing timetable and the maintenance plan on the involved high-speed railway sections is adjusted. The computational results illustrate the effectiveness and efficiency of the proposed model and algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0191-2615
1879-2367
DOI:10.1016/j.trb.2020.02.008