Development of Two-Stage Hybrid Method to Solve High-Speed Rail Train Scheduling Problem

Jyh-Cherng Jong; Sloan Chang; Yung-Cheng (Rex) Lai

doi:10.3141/2374-06

Development of Two-Stage Hybrid Method to Solve High-Speed Rail Train Scheduling Problem

Transportation Research Record Journal of the Transportation Research Board ◽

10.3141/2374-06 ◽

2013 ◽

Vol 2374 (1) ◽

pp. 44-54 ◽

Cited By ~ 2

Author(s):

Jyh-Cherng Jong ◽

Sloan Chang ◽

Yung-Cheng (Rex) Lai

Keyword(s):

Hybrid Method ◽

High Speed ◽

Scheduling Problem ◽

Two Stage ◽

High Speed Rail ◽

Train Scheduling

Download Full-text

Research on Mechanical Automation with Analysis of Mixed Train Scheduling Problem on the High-Speed Rail Line

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.738.219 ◽

2013 ◽

Vol 738 ◽

pp. 219-222 ◽

Cited By ~ 1

Author(s):

Cheng Xuan Cao ◽

Ya Hua Sun ◽

Chao Wu

Keyword(s):

High Speed ◽

Control Strategies ◽

Scheduling Problem ◽

Simulation Approach ◽

Movement Model ◽

High Speed Rail ◽

Train Scheduling ◽

Rail Line ◽

Double Track ◽

Time Movement

In this paper, we study mechanical automation with analysis of mixed train scheduling problem on the high-speed rail line and present a new simulation approach for solving the mixed train scheduling problem on a high-speed double-track rail line. Based on the discrete-time movement model, we propose control strategies for mixed train movement on a high-speed double-track rail line. Using our proposed method, we can effectively simulate the mixed train schedule on a rail line. The numerical results demonstrate that a proper decrease of the departure intervals can enhance the capacity.

Download Full-text

Train Stop Scheduling in a High-Speed Rail Network by Utilizing a Two-Stage Approach

Mathematical Problems in Engineering ◽

10.1155/2012/579130 ◽

2012 ◽

Vol 2012 ◽

pp. 1-11 ◽

Cited By ~ 5

Author(s):

Huiling Fu ◽

Lei Nie ◽

Benjamin R. Sperry ◽

Zhenhuan He

Keyword(s):

High Speed ◽

Large Scale ◽

Programming Model ◽

Practical Experience ◽

Mixed Integer ◽

Two Stage ◽

High Speed Rail ◽

Rail Network ◽

Passenger Traffic ◽

The One

Among the most commonly used methods of scheduling train stops are practical experience and various “one-step” optimal models. These methods face problems of direct transferability and computational complexity when considering a large-scale high-speed rail (HSR) network such as the one in China. This paper introduces a two-stage approach for train stop scheduling with a goal of efficiently organizing passenger traffic into a rational train stop pattern combination while retaining features of regularity, connectivity, and rapidity (RCR). Based on a three-level station classification definition, a mixed integer programming model and a train operating tactics descriptive model along with the computing algorithm are developed and presented for the two stages. A real-world numerical example is presented using the Chinese HSR network as the setting. The performance of the train stop schedule and the applicability of the proposed approach are evaluated from the perspective of maintaining RCR.

Download Full-text

Robust Train Scheduling Problem with Optimized Maintenance Planning on High-Speed Railway Corridors: The China Case

Journal of Advanced Transportation ◽

10.1155/2018/6157192 ◽

2018 ◽

Vol 2018 ◽

pp. 1-16 ◽

Cited By ~ 3

Author(s):

Chuntian Zhang ◽

Yuan Gao ◽

Wenjie Li ◽

Lixing Yang ◽

Ziyou Gao

Keyword(s):

Travel Time ◽

High Speed ◽

Mode Selection ◽

Optimal Solution ◽

Mixed Integer ◽

Planning Problem ◽

Scheduling Problem ◽

Maintenance Planning ◽

State Variables ◽

Train Scheduling

Simultaneously considering train scheduling problem and maintenance planning problem with uncertain travel time, we propose a two-stage integrated optimization model for the sunset-departure and sunrise-arrival trains (SDSA-trains). Specifically, in the first stage, we obtain an optimal solution of the SDSA-trains under each scenario, which leads to the minimum total travel time. In the second stage, a robust SDSA-train schedule is generated based on the optimal solutions of the first stage. The key is that we consider two operation modes to solve the conflict between the SDSA-trains and the maintenances. Some state variables are used to deal with train operation mode selection. Furthermore, some linearization techniques are used to formulate a mixed-integer linear programming (MILP) model. Finally, numerical experiments are implemented to prove the effectiveness of the proposed model and optimization method.

Download Full-text