Data-Driven Method to Estimate the Maximum Likelihood Space–Time Trajectory in an Urban Rail Transit System

Xing Chen, Leishan Zhou, Yixiang Yue, Yu Zhou and Liwen Liu
Additional contact information
Xing Chen: Department of Transportation Management Engineering, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Leishan Zhou: Department of Transportation Management Engineering, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Yixiang Yue: Department of Transportation Management Engineering, School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
Yu Zhou: Department of Civil and Environment Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China
Liwen Liu: Wuhan Metro Operation Co. Ltd., Wuhan 430000, China

Sustainability, 2018, vol. 10, issue 6, 1-21

Abstract: The Urban Rail Transit (URT) passenger travel space–time trajectory reflects a passenger’s path-choice and the components of URT network passenger flow. This paper proposes a model to estimate a passenger’s maximum-likelihood space–time trajectory using Automatic Fare Collection (AFC) transaction data, which contain the passenger’s entry and exit information. First, a method is presented to construct a space–time trajectory within a tap in/out constraint. Then, a maximum likelihood space–time trajectory estimation model is developed to achieve two goals: (1) to minimize the variance in a passenger’s walk time, including the access walk time, egress walk time and transfer walk time when a transfer is included; and (2) to minimize the variance between a passenger’s actual walk time and the expected value obtained by manual survey observation. Considering the computational efficiency and the characteristics of the model, we decompose the passenger’s travel links and convert the maximum likelihood space–time trajectory estimation problem into a single-quadratic programming problem. Real-world AFC transaction data and train timetable data from the Beijing URT network are used to test the proposed model and algorithm. The estimation results are consistent with the clearing results obtained from the authorities, and this finding verifies the feasibility of our approach.

Keywords: space–time trajectory; AFC transaction data; single-quadratic programming problem (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.mdpi.com/2071-1050/10/6/1752/pdf (application/pdf)
https://www.mdpi.com/2071-1050/10/6/1752/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jsusta:v:10:y:2018:i:6:p:1752-:d:149189

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().