Show simple item record

dc.contributor.authorMo, Baichuan
dc.contributor.authorMa, Zhenliang
dc.contributor.authorKoutsopoulos, Haris N
dc.contributor.authorZhao, Jinhua
dc.date.accessioned2024-08-29T19:18:21Z
dc.date.available2024-08-29T19:18:21Z
dc.date.issued2023-03
dc.identifier.urihttps://hdl.handle.net/1721.1/156450
dc.description.abstractThis 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.en_US
dc.language.isoen
dc.publisherInstitute for Operations Research and the Management Sciencesen_US
dc.relation.isversionof10.1287/trsc.2022.1177en_US
dc.rightsCreative Commons Attribution-Noncommercial-ShareAlikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceAuthoren_US
dc.titleEx Post Path Choice Estimation for Urban Rail Systems Using Smart Card Data: An Aggregated Time-Space Hypernetwork Approachen_US
dc.typeArticleen_US
dc.identifier.citationMo, 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).
dc.contributor.departmentMassachusetts Institute of Technology. Department of Civil and Environmental Engineering
dc.contributor.departmentMassachusetts Institute of Technology. Department of Urban Studies and Planning
dc.relation.journalTransportation Scienceen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2024-08-29T19:14:18Z
dspace.orderedauthorsMo, B; Ma, Z; Koutsopoulos, HN; Zhao, Jen_US
dspace.date.submission2024-08-29T19:14:20Z
mit.journal.volume57en_US
mit.journal.issue2en_US
mit.licenseOPEN_ACCESS_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record