Optimization models for high-speed train unit routing problems

Ying Wang, Yuan Gao, Xiaoyuan Yu, Ingo A. Hansen, Jianrui Miao

Research output: Contribution to journalArticleScientificpeer-review

9 Citations (Scopus)
1 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)1273-1281
Number of pages9
JournalComputers and Industrial Engineering
Volume127
DOIs
Publication statusPublished - 2019

Keywords

  • High-speed railway
  • Integer programming
  • Maintenance
  • Train unit routing problem

Fingerprint

Dive into the research topics of 'Optimization models for high-speed train unit routing problems'. Together they form a unique fingerprint.

Cite this