Cyclic Timetable Scheduling Problem on High-speed Railway Line

Journal article (2019)

Authors

Wen Xu Beijing Jiaotong University

Yuyan Tan Beijing Jiaotong University

Bishal Sharma Beijing Jiaotong University

Z. Wang Beijing Jiaotong University

Affiliation

External organisation

High-speed railway MIP model Cyclic train timetable Overtaking rule Fixed departure order

To reference this document use:

http://resolver.tudelft.nl/uuid:3c079525-d6a3-4aa4-9f19-37b4e2cfc4e3

More Info

expand_more

Published Date

2019

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Affiliation

External organisation

Abstract

Due to several obvious advantages both in transport marketing and train operation planning, the cyclic timetable has already applied in many high-speed railway (HSR) countries. In order to adopt the cyclic timetable in China's HSR system, a Mixed Integer Programmer (MIP) model is proposed in this paper involving many general constraints, such as running time, dwell time, headway, and connection constraints. In addition, the real-world overtaking rule that concerning a train with higher priority will not be overtaken by a slower one is incorporated into the cyclic timetable optimization model. An approach based on fixed departure is proposed to get a cyclic timetable with minimum total journey time within a reasonable time. From numerical investigations using data from Guangzhou-Zhuhai HSR line in China, the proposed model and associated approach are tested and shown to be effective.