Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Ex Post Path Choice Estimation for Urban Rail Systems Using Smart Card Data: An Aggregated Time-Space Hypernetwork Approach

Ex Post Path Choice Estimation for Urban Rail Systems Using Smart Card Data: An Aggregated Time-Space Hypernetwork Approach

Thumbnail Image
Download
Name

Ex_Post_Path_Choice_Estimation.pdf

Description
Accepted version
Size

2.61 MB

Format

Adobe PDF

Checksum (MD5)

daa6f7bff75fdbf83447dfae32a9a27b

sword-2024-08-29T19:14:18.original.xml (130 B)
Original SWORD entry document
Author(s)
Mo, Baichuan
•
Ma, Zhenliang
•
Koutsopoulos, Haris N
•
Zhao, Jinhua
Date Issued
March 2023
Journal
Transportation Science
Publisher
Institute for Operations Research and the Management Sciences
Citation
Mo, Baichuan, Ma, Zhenliang, Koutsopoulos, Haris N and Zhao, Jinhua. 2023. "Ex Post Path Choice Estimation for Urban Rail Systems Using Smart Card Data: An Aggregated Time-Space Hypernetwork Approach." Transportation Science, 57 (2).
Version
Author's final manuscript
Abstract
This paper proposes an ex post path choice estimation framework for urban rail systems using an aggregated time-space hypernetwork approach. We aim to infer the actual passenger flow distribution in an urban rail system for any historical day using the observed automated fare collection (AFC) data. By incorporating a schedule-based dynamic transit network loading (SDTNL) model, the framework captures the crowding correlation among stations and the interaction between the path choice and passenger left behind, which is important for the path choice estimation in a “near-capacity” operated urban rail system. The path choice estimation is formulated as an optimization problem, which aims to minimize the difference between the model-derived and observed information with path choice parameters as decision variables. The original problem is intractable because of nonlinear (logit model) and nonanalytical (SDTNL) constraints. A solution procedure is proposed to decompose the original problem into three tractable subproblems, which can be solved efficiently. Solving the decomposed problem is equivalent to finding a fixed point. We prove that the solution to the original problem is the same as the decomposed problem (i.e., the fixed point) when passenger path choices follow the predefined behavior model. If this condition does not hold, the solution of the original problem is proved to be an “almost fixed point” for the decomposed problem. The model is validated using both synthetic and real-world AFC data from a major urban railway system. The analysis with synthetic data validates the model’s effectiveness in estimating path choice parameters and left behind probabilities, which outperforms state-of-art simulation-based optimization methods and probabilistic models in both accuracy and efficiency. The analysis using actual data shows that the estimated path shares are more reasonable than the baseline uniform path shares and survey-derived path shares. The model estimation is robust to different initial parameter values and AFC data from various dates.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Massachusetts Institute of Technology. Department of Urban Studies and Planning
Terms of Use
Creative Commons Attribution-Noncommercial-ShareAlike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/156450
DOI of Published Version
https://doi.org/10.1287/trsc.2022.1177
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.