|
Title: Estimating the Most Likely Space-Time Path by Mining Automatic Fare Collection Data
Accession Number: 01663591
Record Type: Component
Abstract: Automatic Fare Collection (AFC) systems record the time and location information when a passenger enters or leaves the urban rail transit system by swiping his/her smart card. The AFC transaction data records passengers’ trip information exactly and can be used for many researches. This paper aims to estimate the most likely space-time path based on AFC transaction data. A complete passenger’s travel path is consisted of four components: access walk, in-vehicle, egress walk and transfer walk. By constructing a time-extended network based on train timetable data, a space-time path model is formulated to simulate passenger’s trajectory, which tells a passenger’s movements among activity locations with respect to time. Then, a time-dependent maximum likelihood space-time estimation model is proposed to estimate the most likely space-time path for all passengers. Considering the computational efficiency and the characteristic of space-time path, the authors propose an improved Dijkstra algorithm to solve the space-time path estimation problem. Real-world AFC transaction data and train timetable data from Xi’an subway is used to verify the proposed model and algorithm.
Supplemental Notes: This paper was sponsored by TRB committee AP065 Standing Committee on Rail Transit Systems.
Report/Paper Numbers: 18-01144
Language: English
Authors: Xing, ChenZhou, LeishanTang, JinjinHanxiao, ZhouPagination: 17p
Publication Date: 2018
Conference:
Transportation Research Board 97th Annual Meeting
Location:
Washington DC, United States Media Type: Digital/other
Features: Figures; Maps; References; Tables
TRT Terms: Geographic Terms: Subject Areas: Data and Information Technology; Operations and Traffic Management; Passenger Transportation; Railroads
Source Data: Transportation Research Board Annual Meeting 2018 Paper #18-01144
Files: TRIS, TRB, ATRI
Created Date: Jan 8 2018 10:17AM
|