Validating Rail Transit Assignment Models with Cluster Analysis and Automatic Fare Collection Data

Author(s):  
Wei Zhu ◽  
Feng Zhou ◽  
Jiajun Huang ◽  
Ruihua Xu

Passenger flow data are necessary for making and coordinating operational plans for urban rail transit (URT) systems; the availability and the service state of those systems directly influence the activity of a city and its people. Although many transit assignment models have been developed, the results of passenger flows estimated by these models as well as assumptions made in the estimation process, especially for large-scale, complex, and dynamically changing URT networks, had not been validated. This paper proposes a methodology that can validate existing URT assignment models by using automatic fare collection data and a cluster analysis technique. Initial applications to the URT system of Shanghai, China, which is one of the largest in the world, show that the proposed approach works well and can efficiently find the origin–destination pairs in which passengers' route choices are misestimated by those assignment models. The analysis suggests that several factors result in errors (for the URT assignment model used in Shanghai). These factors include the threshold for the difference in travel costs, a misrepresentation of the transferring cost, and inadequate values for the standard deviation. This information is useful for detecting errors in existing URT assignment models, leading to improvements.

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.


Transport ◽  
2021 ◽  
Vol 0 (0) ◽  
pp. 1-12
Author(s):  
Wencheng Huang ◽  
Yue Zhang ◽  
Yifei Xu ◽  
Rui Zhang ◽  
Minhao Xu Xu ◽  
...  

In order to evaluate the URTPSQ (Urban Rail Transit Passenger Service Quality) comprehensively, find the shortage of URTPSQ, find out the difference between the actual service situation and the passenger’s expectation and demand,and provide passengers with better travel services, a passenger-oriented KANO–Entropy–TOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) method is proposed and applied in this paper. Firstly, a KANO model is applied to select the service quality indicators from the 24 URTPSQ evaluation sub-indicators, according to the selection results, the KANO service quality indicators of URTPSQ are constructed. Then the sensitivity of the KANO service quality indicators based on the KANO model are calculated and ranked, the PS (Passenger Satisfaction) of each KANO service quality indicator by using the Entropy–TOPSIS method is calculated and ranked. Based on the difference between the sensitivity degree rank and the satisfaction degree rank of each KANO service quality indicator, determine the service quality KANO indicators of the URTPSQ that need to be improved significantly. A case study is conducted by taking the Chengdu subway system in China as a background. The results show that the Chengdu subway operation enterprises should pay attention to the must-be demand first, then the one-dimensional demand, finally the attractive demand. The three indicators, including transfer on the same floor in the station, service quality of staffs of urban rail transit enterprises,and cleanness in the station and passenger coach, need to be improved urgently. For the managers and operators of urban rail transit system, the passengers’ must-be demand should be satisfied first if the KANO model is applied to evaluate the service. The indicators with highest sensitivity degree and lowest TOPSIS value should be improved based on the KANO–Entropy–TOPSIS model.


2020 ◽  
Vol 47 (8) ◽  
pp. 898-907 ◽  
Author(s):  
Islam Kamel ◽  
Amer Shalaby ◽  
Baher Abdulhai

Although the traffic and transit assignment processes are intertwined, the interactions between them are usually ignored in practice, especially for large-scale networks. In this paper, we build a simulation-based traffic and transit assignment model that preserves the interactions between the two assignment processes for the large-scale network of the Greater Toronto Area during the morning peak. This traffic assignment model is dynamic, user-equilibrium seeking, and includes surface transit routes. It utilizes the congested travel times, determined by the dynamic traffic assignment, rather than using predefined timetables. Unlike the static transit assignment models, the proposed transit model distinguishes between different intervals within the morning peak by using the accurate demand, transit schedule, and time-based road level-of-service. The traffic and transit assignment models are calibrated against actual field observations. The resulting dynamic model is suitable for testing different demand management strategies that impose dynamic changes on multiple modes simultaneously.


2020 ◽  
Vol 545 ◽  
pp. 123538 ◽  
Author(s):  
Pengfei Lin ◽  
Jiancheng Weng ◽  
Yu Fu ◽  
Dimitrios Alivanistos ◽  
Baocai Yin

Sign in / Sign up

Export Citation Format

Share Document