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

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.

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