scholarly journals A Key Station Identification Method for Urban Rail Transit: A Case Study of Beijing Subway

2017 ◽  
Vol 29 (3) ◽  
pp. 267-273 ◽  
Author(s):  
Shiwei Sun ◽  
Haiying Li ◽  
Xinyue Xu

Congestion occurs and propagates in the stations of urban rail transit, which results in the impendent need to comprehensively evaluate the station performance. Based on complex network theory, a key station identification method is considered. This approach considers both the topology and dynamic operation states of urban rail transit network, such as degree, passenger demand, system capacity and capacity utilization. A case of Beijing urban rail transit is applied to verify the validation of the proposed method. It shows that the method can be helpful to daily passenger flow control and capacity enhancement during peak hours.

2020 ◽  
pp. 2150075
Author(s):  
Junwei Zeng ◽  
Yongsheng Qian ◽  
Xiaodi Liu ◽  
Chaoyang Zhang ◽  
Dejie Xu ◽  
...  

The rapid development of new urbanization boosts the pace of urban rail transit (URT) network construction. The new-built lines not only facilitate people’s daily travel, but also change the reliability of the original network. In this paper, based on the complex network theory, the static characteristics of Tianjin URT represented by the current and forward networks are analyzed. The global efficiency is selected as the evaluation index to analyze the evolution characteristics of the network. The results show that Zhigu station and Xiawafang station are more vulnerable in the current network, while Zhangxingzhuang station and Jinzhonghe street station are the key stations in the forward network, and need to be paid more attention. Meanwhile, the lines M9 and Z2 as the key lines in the long-term network and their reliability must be ensured.


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.


Sign in / Sign up

Export Citation Format

Share Document