Strategies to Enhance the Resilience of an Urban Rail Transit Network

Author(s):  
Jinqu Chen ◽  
Jie Liu ◽  
Qiyuan Peng ◽  
Yong Yin

An urban rail transit (URT) system is an important component of an urban infrastructure system; however, it is vulnerable to disturbances, such as natural disasters and terrorist attacks. Constructing a highly resilient URT network has practical significance for enhancing its capability to respond to disturbances. In this paper, models are developed to optimize a URT network’s structure with regard to resilience and to enhance the resilience of a disrupted URT network. A bi-level programming model that aims to maximize a URT network’s global accessibility and global efficiency is formulated to optimize the structure of the network. A novel repair strategy, called the simulation repair strategy, is proposed to enhance the resilience of a disrupted URT network by optimizing the repair sequence of failed stations. The models are utilized to enhance the resilience of the Chengdu subway network. The result indicates that the bi-level programming model guides the construction of new links to optimize the structure of the Chengdu subway network. Deliberate attacks are more harmful to the Chengdu subway network than random attacks. The network’s operators need to pay attention to the operations of critical stations (e.g., Chunxi Road station and Tianfu Square station) to prevent disturbances from exerting considerable negative effects on the network’s normal operations. The simulation repair strategy exhibits higher repair efficiency than the conventional repair strategy, and it effectively enhances the resilience of the disrupted Chengdu subway network.

2014 ◽  
Vol 488-489 ◽  
pp. 1439-1443
Author(s):  
Jin Hai Li ◽  
Jian Feng Liu

Hyperpaths enumeration is one of the basic procedures in many traffic planning issues. As a result of its distinctive structure, hyperpaths in Urban Rail Transit Network (URTN) are different from those in road network. Typically, one may never visit a station more than once and would never transfer from one line to another that has been visited in a loopless URTN, meaning that stations a hyperpath traversed cannot be repeated, neither do lines in loopless networks. This paper studies the relationships between feasible path and the shortest path in terms of travel costs. In this paper, a new definition of hyperpath in URTN is proposed and a new algorithm based on the breadth first searching (BFS) method is presented to enumerate the hyperpaths. The algorithm can safely avoid hyperpath omission and can even be applied in networks containing loops as well. The influence of parameters on hyperpaths is studied by experimentally finding hyperpaths in the subway network in Beijing. A group of suggested parameter pairs are then given. Finally, a numerical experiment is used to illustrate the validity of the proposed algorithm. The results imply the significance of the convergence of the BFS algorithm which can be used to search hyperpaths in large scale URTN even with loop.


2014 ◽  
Vol 513-517 ◽  
pp. 3958-3963 ◽  
Author(s):  
Bo Gao ◽  
Ling Xi Zhu ◽  
Xue Mei Xiao

Based on the multi-source information fusion and complex network theory, through studying the effective matching and integration of safety equipment and spatial information of urban rail transit network operation, a safety assessment model is proposed: through equipment fusion and the node fusion, the global safety parameter is obtained, which is accurate in description and evaluation of urban rail transit operating than the partial safety factors and realize the transform from microscopic description to macroscopic description.


2011 ◽  
Vol 243-249 ◽  
pp. 4375-4380
Author(s):  
Yuan Chun Huang ◽  
Jian Li ◽  
Haize Pan

Through analyzing the factors affecting passengers’ path-choice, the corresponding principles and rules of the ticket income distribution are put forward and the new model of the Urban Rail Transit Network in Beijing is set up in the paper. Through the deformation of the urban rail transit and the simplification of the lines, the topology of the urban rail transit lines is abstracted into an undirected connection graph. Breadth-priority optimization algorithm is applied to search the effective paths between the OD and the flow-matching ratio is acquired by calculating based on multi-factor matching algorithm, in which many relevant numerical examples are analyzed to verify the feasibility of the dual-ratio method and to summarize the characteristics of the project.


Sign in / Sign up

Export Citation Format

Share Document