scholarly journals Design of Urban Rail Transit Network Constrained by Urban Road Network, Trips and Land-Use Characteristics

2019 ◽  
Vol 11 (21) ◽  
pp. 6128 ◽  
Author(s):  
Shushan Chai ◽  
Qinghuai Liang ◽  
Simin Zhong

In the process of urban rail transit network design, the urban road network, urban trips and land use are the key factors to be considered. At present, the subjective and qualitative methods are usually used in most practices. In this paper, a quantitative model is developed to ensure the matching between the factors and the urban rail transit network. In the model, a basic network, which is used to define the roads that candidate lines will pass through, is firstly constructed based on the locations of large traffic volume and main passenger flow corridors. Two matching indexes are proposed: one indicates the matching degree between the network and the trip demand, which is calculated by the deviation value between two gravity centers of the stations’ importance distribution in network and the traffic zones’ trip intensity; the other one describes the matching degree between the network and the land use, which is calculated by the deviation value between the fractal dimensions of stations’ importance distribution and the traffic zones’ land-use intensity. The model takes the maximum traffic turnover per unit length of network and the minimum average volume of transfer passengers between lines as objectives. To solve the NP-hard problem in which the variables increase exponentially with the increase of network size, a neighborhood search algorithm is developed based on simulated annealing method. A real case study is carried out to show that the model and algorithm are 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.


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.


2015 ◽  
Vol 60 ◽  
pp. 1-23 ◽  
Author(s):  
Yihui Wang ◽  
Tao Tang ◽  
Bin Ning ◽  
Ton J.J. van den Boom ◽  
Bart De Schutter

Sign in / Sign up

Export Citation Format

Share Document