Characteristics on hub networks of urban rail transit networks

2016 ◽  
Vol 447 ◽  
pp. 502-507 ◽  
Author(s):  
Jianhua Zhang ◽  
Shuliang Wang ◽  
Zhaojun Zhang ◽  
Kuansheng Zou ◽  
Zhan Shu
Keyword(s):  
Urban Rail Transit ◽  
Rail Transit ◽  
Transit Networks ◽  
Urban Rail ◽  
Hub Networks

scholarly journals First Train Timetabling for Urban Rail Transit Networks with Maximum Passenger Transfer Satisfaction

2020 ◽  
Vol 12 (10) ◽  
pp. 4166 ◽  
Author(s):  
Xuan Li ◽  
Toshiyuki Yamamoto ◽  
Tao Yan ◽  
Lili Lu ◽  
Xiaofei Ye
Keyword(s):  
Waiting Time ◽  
Stated Preference ◽  
Urban Rail Transit ◽  
Rail Transit ◽  
Transit Network ◽  
Transit Networks ◽  
Bee Colony ◽  
Passenger Satisfaction ◽  
Urban Rail ◽  
Urban Rail Transit Network

This paper proposes a novel model to optimize the first train timetables for urban rail transit networks, with the goal of maximizing passengers’ transfer waiting time satisfaction. To build up the relationship of transfer waiting time and passenger satisfaction, a reference-based piecewise function is formulated with the consideration of passengers’ expectations, tolerances and dissatisfaction on “just miss”. In order to determine the parameters of zero waiting satisfaction rating, the most comfortable waiting time, and the maximum tolerable waiting time in time satisfaction function, a stated preference survey is conducted in rail transit transfer stations in Shanghai. An artificial bee colony algorithm is developed to solve the timetabling model. Through a real-world case study on Shanghai’s urban rail transit network and comparison with the results of minimizing the total transfer time, we demonstrate that our approach performs better in decreasing extremely long wait and “just miss” events and increasing the number of passengers with a relatively comfortable waiting time in [31s, 5min). Finally, four practical suggestions are proposed for urban rail transit network operations.

scholarly journals Vulnerability Assessments of Urban Rail Transit Networks Based on Redundant Recovery

2020 ◽  
Vol 12 (14) ◽  
pp. 5756
Author(s):  
Jianhua Zhang ◽  
Ziqi Wang ◽  
Shuliang Wang ◽  
Shengyang Luan ◽  
Wenchao Shao
Keyword(s):  
Construction Cost ◽  
Urban Rail Transit ◽  
Strength Parameter ◽  
Rail Transit ◽  
System Failures ◽  
Transit Networks ◽  
Vulnerability Assessments ◽  
Urban Rail ◽  
Recovery Scheme

Urban rail transit has received much attention in the last two decades, and a significant number of cities have established urban rail transit networks (URTNs). Although URTNs have brought enormous convenience to the daily life of citizens, system failures still frequently occur, therefore the vulnerability of URTNs must be a concern. In this paper, we propose a novel measurement called the node strength parameter to assess the importance of nodes and present a redundant recovery scheme to imitate the system recovery of URTNs subjected to failures. Employing three malicious attacks and taking the Nanjing subway network as the case study, we investigated the network vulnerability under scenarios of different simulated attacks. The results illustrate that passenger in-flow shows the negligible impact on the vulnerability of the node, while out-flow plays a considerable role in the largest strength node-based attack. Further, we find that vulnerability will decrease as passenger out-flow increases, and the vulnerability characteristics are the same with the increase in the construction cost of URTNs. Considering different attack scenarios, the results indicate that the highest betweenness node-based attack will cause the most damage to the system, and increasing the construction cost can improve the robustness of URTNs.

Estimating the influence of common disruptions on urban rail transit networks

2016 ◽  
Vol 94 ◽  
pp. 62-75 ◽  
Author(s):  
Huijun Sun ◽  
Jianjun Wu ◽  
Lijuan Wu ◽  
Xiaoyong Yan ◽  
Ziyou Gao
Keyword(s):  
Urban Rail Transit ◽  
Rail Transit ◽  
Transit Networks ◽  
Urban Rail

Scenario-Based Integrated Assignment Model for Bi-Class User Rail Transit Networks

2013 ◽  
Vol 361-363 ◽  
pp. 1963-1966
Author(s):  
Wei Zhu
Keyword(s):  
Urban Rail Transit ◽  
Rail Transit ◽  
Transit Networks ◽  
Assignment Model ◽  
Urban Rail ◽  
Proposed Model ◽  
Scale Network ◽  
Algorithm Framework ◽  
Real Scale

An integrated assignment model for urban rail transit (URT) networks was proposed and discussed in four typical scenarios with the consideration of passenger difference between native and non-native. An overall algorithm framework for the model was also developed, which introduced three critical route choice models and combined them appropriately to different scenarios. A case study was performed on a real-scale network of Shanghai during the Expo 2010. The results revealed that the proposed model can deliver more appropriate solution to the assignment problem compared to the existing practice in the real world.

scholarly journals A COMPUTATION METHOD ON TIME-DEPENDENT ACCESSIBILITY OF URBAN RAIL TRANSIT NETWORKS FOR THE LAST SERVICE

Transport ◽  
2020 ◽  
Vol 35 (1) ◽  
pp. 26-36
Author(s):  
Yao Chen ◽  
Baohua Mao ◽  
Yun Bai ◽  
Zhujun Li ◽  
Jimeng Tang
Keyword(s):  
Urban Rail Transit ◽  
Time Dependent ◽  
Computation Method ◽  
Rail Transit ◽  
Practical Applications ◽  
Transit Networks ◽  
Urban Rail ◽  
Accessibility Problem ◽  
Transfer Stations ◽  
Label Setting Algorithm

Urban rail transit networks seldom provide 24-hour service. The last train is the latest chance for passengers. If passengers arrive too late to catch the last train, the path becomes inaccessible. The network accessibility thus varies depending on the departure time of passenger trips. This paper focuses on the computation method on the time-dependent accessibility of urban rail transit networks in order to facilitate the itinerary planning of passengers. A label setting algorithm is first designed to calculate the latest possible times for Origin–Destination (O–D) pairs, which is the latest departure times of passengers from the origins such that the destinations can be reach successfully. A searching approach is then developed to find the shortest accessible path at any possible departure times. The method is applied in a real-world metro network. The results show that the method is a powerful tool in solving the service accessibility problem. It has the ability to allow passengers to plan an optimal itinerary. Comparison analysis indicates that the proposed method can provide exact solutions in much shorter time, compared with a path enumeration method. Extensive tests on a set of random networks indicate that the method is efficient enough in practical applications. The execution time for an O–D pair on a personal computer with 2.8 GHZ CPU and 4GB of RAM is only 1.2 s for urban rail transit networks with 100 transfer stations.

Sign in / Sign up

Export Citation Format

Share Document