Research on the safety evaluation index of urban rail transit network operation

2011 ◽  
Author(s):  
Xuemei Xiao ◽  
Xi Wang
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.


2014 ◽  
Vol 488-489 ◽  
pp. 1413-1418 ◽  
Author(s):  
Chen Wang ◽  
Kuan Min Chen

According to the multi-objective features and the importance of scientific decision-making in the scheme selection of rail transit network planning, this paper constructed an evaluation index system of rail transit network from the aspects of network function, traffic function and economic evaluation. After considering the experts knowledge and experience, decision-makers intention and the information contained in the data, the comprehensive evaluation index weight was determined by using AHP and entropy weight method. And also, this paper combined with standardized decision matrix and selected index weight to construct weighted decision matrix and the positive and negative ideal project plan of weighted standardization decision matrix was determined based on TOPSIS. The superiority of urban rail transit network was evaluated through calculating the similarity between scheme index matrix and ideal scheme. Finally, an example was given to prove the model was scientific and effective.


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.


Sign in / Sign up

Export Citation Format

Share Document