Line Planning in Emergencies for Railway Network

2017 ◽  
pp. 59-74
Author(s):  
Limin Jia ◽  
Xuelei Meng ◽  
Yong Qin
Keyword(s):  
Railway Network ◽  
Line Planning

scholarly journals Method for Determining the Valid Travel Route of Railways Based on Generalised Cost under the Syncretic Railway Network

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Zhiqiang Tian ◽  
Guofeng Sun ◽  
Dingjun Chen ◽  
Zhicheng Qiu ◽  
Yawen Ma
Keyword(s):  
High Speed ◽  
Search Algorithm ◽  
Cost Calculation ◽  
Railway Network ◽  
Line Planning ◽  
Integrated Network ◽  
Railway Line ◽  
Passenger Travel ◽  
Normal Speed ◽  
Generalised Cost

Travel route options for passengers can provide data support for railway line planning, passenger flow organisation, and train operation establishment. A critical review of the literature indicates that previous studies mainly focused on choices offered by a single railway network path without much consideration of China’s normal-speed and high-speed integrated railway network and the effect of train timetable on passengers’ travel choice. In this study, a method based on generalised cost is proposed to discover the valid routes of passenger travel in the integrated network of China’s normal-speed and high-speed railways. After quantifying the effects of train fare, travel time, transfer, travel convenience, comfort, and other factors on the generalised expenses of passengers, this study presents a generalised cost determination method when individuals select an option from different seats of different trains of specific railway transport products. Theoretically, the valid routes considering the train schedule is defined, and a valid route search algorithm is designed using the deep traversal idea in a new valid route searching network. Considering the Lanzhou-Beijing passenger travel routes as an example, this study verifies the practicability of the generalised cost calculation method, as well as that of the valid routes search method.

scholarly journals A Matheuristic Iterative Approach for Profit-Oriented Line Planning Applied to the Chinese High-Speed Railway Network

2020 ◽  
Vol 2020 ◽  
pp. 1-18
Author(s):  
Di Liu ◽  
Javier Durán Micco ◽  
Gongyuan Lu ◽  
Qiyuan Peng ◽  
Jia Ning ◽  
...  
Keyword(s):  
Travel Time ◽  
Real World ◽  
High Speed ◽  
Computational Experiments ◽  
Planning Problem ◽  
Iterative Approach ◽  
Railway Network ◽  
Line Planning ◽  
High Speed Railway ◽  
Passenger Assignment

In this paper, a matheuristic iterative approach (MHIA) is proposed to solve the line planning problem, also called network design problem, and frequency setting on the Chinese high-speed railway network. Our optimization model integrates the cost-oriented and passenger-oriented objectives into a profit-oriented objective. Therefore, the passenger travel time is incorporated in the ticket price using a travel time value. As a result, transfers and detours will result in lower ticket prices and thus lower revenues for the operator. When evaluating the performance of a given line plan, the way in which passengers will travel through the network needs to be modelled. This passenger assignment is typically a time-consuming calculation. The proposed line planning approach iteratively improves the line plan using easy-to-determine indicators. During the process, a mixed integer linear programming model addresses the passenger assignment and optimizes the frequency setting in order to maximise the operational profit. Extensive computational experiments are executed to show the effectiveness of the proposed approach to deal with the real-world railway network line planning problem. Through extensive computational experiments on the small example network and real-world-based instances, the results show that the proposed model can improve the profits by 22.4% on average comparing to their initial solutions. When comparing to an alternative iterative approach, our proposed method has advantage of obtaining high quality of solutions by improving the profit 10.8% on average. For small, medium, and large size networks, the obtained results are close to the optimal solutions, when available.

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

2013 ◽  
Vol 30 (04) ◽  
pp. 1350006 ◽  
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.

Manchoukuo Completes Strategic Railway Network

1937 ◽  
Vol 6 (7) ◽  
pp. 79-80
Author(s):  
J. R. S.
Keyword(s):  
Railway Network

Service Provision on a Railway Network: A Laboratory Experiment

2012 ◽  
Author(s):  
Aurora García-Gallego ◽  
Nikolaos Georgantzis ◽  
Gerardo Vicente Sabater
Keyword(s):  
Laboratory Experiment ◽  
Service Provision ◽  
Railway Network
Sign in / Sign up

Export Citation Format

Share Document