TY - JOUR
T1 - Optimization models for high-speed train unit routing problems
AU - Wang, Ying
AU - Gao, Yuan
AU - Yu, Xiaoyuan
AU - Hansen, Ingo A.
AU - Miao, Jianrui
N1 - Accepted Author Manuscript
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
KW - High-speed railway
KW - Integer programming
KW - Maintenance
KW - Train unit routing problem
UR - http://www.scopus.com/inward/record.url?scp=85042921565&partnerID=8YFLogxK
UR - http://resolver.tudelft.nl/uuid:2e2cd06e-41e7-4e5e-bc2a-81b8c2389b5c
U2 - 10.1016/j.cie.2018.02.039
DO - 10.1016/j.cie.2018.02.039
M3 - Article
AN - SCOPUS:85042921565
SN - 0360-8352
VL - 127
SP - 1273
EP - 1281
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
ER -