High-Speed Railway EMUs’ Circulation Plan Optimization: A Two-Stage Optimization Algorithm Based on Column Generation

Column Generation Accelerated Algorithm and Optimisation for a High-Speed Railway Train Timetabling Problem

Symmetry ◽

10.3390/sym11080983 ◽

2019 ◽

Vol 11 (8) ◽

pp. 983 ◽

Cited By ~ 1

Author(s):

Jin Wang ◽

Leishan Zhou ◽

Yixiang Yue

Keyword(s):

Column Generation ◽

High Speed ◽

Rapid Development ◽

Master Problem ◽

High Speed Railway ◽

Train Timetabling ◽

Passenger Traffic ◽

Computation Efficiency ◽

Increasing Demand ◽

Mathematical Optimisation

With the rapid development of high-speed railway (HSR) systems, the increasing demand for passenger traffic has put forward higher requirements for HSR train timetabling problems (HSRTTPs). This paper establishes two mathematical optimisation models with different optimisation objectives for an HSRTTP and solves these models through a column generation-based algorithm. However, the column generation-based algorithm has the disadvantage of a slow convergence rate, thus we put forward corresponding acceleration strategies for five stages of the algorithm: preprocessing, restricted master problem, pricing problem, branch-and-bound and postprocessing from a symmetry point between the computation efficiency and the accuracy. The effectiveness of the acceleration strategies was validated by a case study of the Beijing–Shanghai HSR. The results show that the proposed optimal acceleration strategies can increase the computation efficiency of the algorithm by 11.8× on average while ensuring the accuracy.

Download Full-text

Handover Optimization Algorithm in LTE High-Speed Railway Environment

Wireless Personal Communications ◽

10.1007/s11277-015-2704-8 ◽

2015 ◽

Vol 84 (2) ◽

pp. 1577-1589 ◽

Cited By ~ 5

Author(s):

Fang Yang ◽

Honggui Deng ◽

Fangqing Jiang ◽

Xu Deng

Keyword(s):

Optimization Algorithm ◽

High Speed ◽

High Speed Railway

Download Full-text

A Column Generation Algorithm for High-Speed Railway Seat Inventory Control

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.919-921.1055 ◽

2014 ◽

Vol 919-921 ◽

pp. 1055-1062

Author(s):

Yuan Huang ◽

He Song ◽

Li Xia Tian

Keyword(s):

Inventory Control ◽

Column Generation ◽

High Speed ◽

Large Scale ◽

Optimization Theory ◽

Computation Time ◽

High Speed Rail ◽

High Speed Railway ◽

Generation Algorithm ◽

Seat Inventory Control

Huge investment in high-speed railway construction, whether its own operations economically rational, and how to develop a scientific and reasonable amount of high-speed rail ticket distribution scheme has become an important part of the high-speed rail operations optimization theory and applications. This paper gives a comprehensive consideration of economic and public services about the optimization model in order to maximize the expected revenue for the high-speed rail trains single objective function. Then proposed a heuristic column generation algorithm, compared to traditional linear programming methods, to a large extent reduce the number of iterations and computation time. Finally, we generate a random distribution of data to verify the algorithm can efficiently solve large-scale seat inventory control problems.

Download Full-text

COLUMN GENERATION APPROACH TO LINE PLANNING WITH VARIOUS HALTING PATTERNS — APPLICATION TO THE KOREAN HIGH-SPEED RAILWAY

Asia Pacific Journal of Operational Research ◽

10.1142/s0217595913500061 ◽

2013 ◽

Vol 30 (04) ◽

pp. 1350006 ◽

Cited By ~ 6

Author(s):

BUM HWAN PARK ◽

YONG-IL SEO ◽

SUNG-PIL HONG ◽

HAG-LAE RHO

Keyword(s):

Column Generation ◽

High Speed ◽

Railway Network ◽

Line Planning ◽

High Speed Railway ◽

Railway Line ◽

Planning Optimization ◽

Planning Models ◽

Passenger Travel ◽

Planning Problems

This study investigated railway line planning optimization models that determine the frequency of trains on each line to satisfy passenger origin–destination demands while minimizing related costs. Most line planning models assume that all trains on the same route run with the same halting pattern. However, to minimize passenger travel time and to provide a train service with faster travel times to as many stations as possible, we must consider various halting patterns; these patterns can be provided in advance or are required to be formulated. Our study addresses two line planning problems that consider halting patterns, describes the computational complexities of each problem, and presents the column generation approach for one model. We also present experimental results obtained for the Korean high-speed railway network.

Download Full-text