A double time-scale passenger assignment model for high-speed railway networks with continuum capacity approximation

2021 ◽  
Vol 150 ◽  
pp. 102305
Author(s):  
Guangming Xu ◽  
Wei Liu ◽  
Runfa Wu ◽  
Hai Yang
Keyword(s):  
Time Scale ◽  
High Speed ◽  
High Speed Railway ◽  
Assignment Model ◽  
Railway Networks ◽  
Double Time ◽  
Passenger Assignment

Stochastic Analysis of DASH-Based Video Service in High-Speed Railway Networks

2019 ◽  
Vol 21 (6) ◽  
pp. 1577-1592 ◽  
Author(s):  
Zhongbai Jiang ◽  
Changqiao Xu ◽  
Jianfeng Guan ◽  
Yang Liu ◽  
Gabriel-Miro Muntean
Keyword(s):  
Stochastic Analysis ◽  
High Speed ◽  
High Speed Railway ◽  
Video Service ◽  
Railway Networks

Optimizing train frequencies and train routing with simultaneous passenger assignment in high-speed railway network

2020 ◽  
Vol 148 ◽  
pp. 106650
Author(s):  
Xiaojuan Li ◽  
Dewei Li ◽  
Xiaotian Hu ◽  
Zhenying Yan ◽  
Yongsheng Wang
Keyword(s):  
High Speed ◽  
Railway Network ◽  
High Speed Railway ◽  
Train Routing ◽  
Passenger Assignment

scholarly journals Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-16 ◽  
Author(s):  
J. Xie ◽  
S. C. Wong ◽  
S. M. Lo
Keyword(s):  
High Speed ◽  
Optimal Path ◽  
Low Frequency ◽  
Proper Treatment ◽  
High Speed Railway ◽  
Transit Systems ◽  
Transit Network ◽  
Transit Networks ◽  
Optimal Paths ◽  
Railway Networks

High-speed railways have been developing quickly in recent years and have become a main travel mode between cities in many countries, especially China. Studying passengers’ travel choices on high-speed railway networks can aid the design of efficient operations and schedule plans. The Tong and Richardson algorithm that is used in this model offers a promising method for finding the optimal path in a schedule-based transit network. However, three aspects of this algorithm limit its application to high-speed railway networks. First, these networks have more complicated common line problems than other transit networks. Without a proper treatment, the optimal paths cannot be found. Second, nonadditive fares are important factors in considering travel choices. Incorporating these factors increases the searching time; improvement in this area is desirable. Third, as high-speed railways have low-frequency running patterns, their passengers may prefer to wait at home or at the office instead of at the station. Thus, consideration of a waiting penalty is needed. This paper suggests three extensions to improve the treatments of these three aspects, and three examples are presented to illustrate the applications of these extensions. The improved algorithm can also be used for other transit systems.

When High-Speed Railway Networks Meet Multipath TCP: Supporting Dependable Communications

2020 ◽  
Vol 9 (2) ◽  
pp. 202-205 ◽  
Author(s):  
Jianpeng Xu ◽  
Bo Ai ◽  
Liangyu Chen ◽  
Li Pei ◽  
Yujian Li ◽  
...  
Keyword(s):  
High Speed ◽  
High Speed Railway ◽  
Multipath Tcp ◽  
Railway Networks

Analysis of Link Lifetime With Auto-Correlated Shadowing in High-Speed Railway Networks

2015 ◽  
Vol 19 (12) ◽  
pp. 2106-2109 ◽  
Author(s):  
Miao Hu ◽  
Zhangdui Zhong ◽  
Minming Ni ◽  
Ruisi He
Keyword(s):  
High Speed ◽  
High Speed Railway ◽  
Correlated Shadowing ◽  
Railway Networks
Sign in / Sign up

Export Citation Format

Share Document