.png){kind=icon}
.png){kind=icon}
Return
Optimization models for high-speed train unit routing problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.cie.2018.02.039.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Train unit routing problem determines the number of train units needed to carry out involved trips, which is a significant part of railway operation cost. In this paper, we focus on high-speed train unit routing problems, in which maintenance resource constraints both on time and distance are taken into account. Based on a connection network, this paper first proposes a general train unit routing model. Then, the general model is specialized to meet the circulation and maintenance conditions of high-speed train units in China, which is based on a special connection network with a two-day time horizon. A strategy is proposed to reduce the scale of the connection network, which improves the model's solvability. Furthermore, an extension on multi-depot train unit routing problem is discussed. Finally, numerical experiments based on the real data of Chinese high-speed railway are carried out to verify the effectiveness and efficiency of the proposed mode and method.
Keywords:
High-speed railway
Train unit routing problem
Maintenance
Integer programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W