IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v10y2018i6p1752-d149189.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • Xing Chen & Leishan Zhou & Yixiang Yue & Yu Zhou & Liwen Liu, 2018. "Data-Driven Method to Estimate the Maximum Likelihood Space–Time Trajectory in an Urban Rail Transit System," Sustainability, MDPI, vol. 10(6), pages 1-21, May.
    • Handle: RePEc:gam:jsusta:v:10:y:2018:i:6:p:1752-:d:149189
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/10/6/1752/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/10/6/1752/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lu, Chung-Cheng & Liu, Jiangtao & Qu, Yunchao & Peeta, Srinivas & Rouphail, Nagui M. & Zhou, Xuesong, 2016. "Eco-system optimal time-dependent flow assignment in a congested network," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 217-239.
    2. Schmöcker, Jan-Dirk & Bell, Michael G.H. & Kurauchi, Fumitaka, 2008. "A quasi-dynamic capacity constrained frequency-based transit assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 925-945, December.
    3. Hamdouch, Younes & Lawphongpanich, Siriphong, 2008. "Schedule-based transit assignment model with travel strategies and capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 42(7-8), pages 663-684, August.
    4. Tong, C. O. & Wong, S. C., 2000. "A predictive dynamic traffic assignment model in congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 625-644, November.
    5. Cepeda, M. & Cominetti, R. & Florian, M., 2006. "A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 40(6), pages 437-459, July.
    6. Poon, M. H. & Wong, S. C. & Tong, C. O., 2004. "A dynamic schedule-based model for congested transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 38(4), pages 343-368, May.
    7. Connors, Richard D. & Sumalee, Agachai, 2009. "A network equilibrium model with travellers' perception of stochastic travel times," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 614-624, July.
    8. Zhu, Yiwen & Koutsopoulos, Haris N. & Wilson, Nigel H.M., 2017. "A probabilistic Passenger-to-Train Assignment Model based on automated data," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 522-542.
    9. Takahiko Kusakabe & Takamasa Iryo & Yasuo Asakura, 2010. "Estimation method for railway passengers’ train choice behavior with smart card transaction data," Transportation, Springer, vol. 37(5), pages 731-749, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hui Xu & Liudan Jiao & Shulin Chen & Milan Deng & Ningxin Shen, 2018. "An Innovative Approach to Determining High-Risk Nodes in a Complex Urban Rail Transit Station: A Perspective of Promoting Urban Sustainability," Sustainability, MDPI, vol. 10(7), pages 1-17, July.
    2. Yu, Liping & Liu, Huiran & Fang, Zhiming & Ye, Rui & Huang, Zhongyi & You, Yayun, 2023. "A new approach on passenger flow assignment with multi-connected agents," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 628(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhu, Yiwen & Koutsopoulos, Haris N. & Wilson, Nigel H.M., 2017. "A probabilistic Passenger-to-Train Assignment Model based on automated data," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 522-542.
    2. Shang, Pan & Li, Ruimin & Guo, Jifu & Xian, Kai & Zhou, Xuesong, 2019. "Integrating Lagrangian and Eulerian observations for passenger flow state estimation in an urban rail transit network: A space-time-state hyper network-based assignment approach," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 135-167.
    3. Canca, David & Andrade-Pineda, José Luis & De los Santos, Alicia & Calle, Marcos, 2018. "The Railway Rapid Transit frequency setting problem with speed-dependent operation costs," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 494-519.
    4. Shang, Pan & Xiong, Yufan & Guo, Jifu & Xian, Kai & Yu, Yun & Xu, Han, 2024. "A modeling framework to integrate frequency - and schedule-based passenger assignment approaches for coordinated path choice and space-time trajectory estimation based on multi-source observations," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    5. Taoyuan Yang & Peng Zhao & Xiangming Yao, 2020. "A Method to Estimate URT Passenger Spatial-Temporal Trajectory with Smart Card Data and Train Schedules," Sustainability, MDPI, vol. 12(6), pages 1-13, March.
    6. Cats, Oded & West, Jens & Eliasson, Jonas, 2016. "A dynamic stochastic model for evaluating congestion and crowding effects in transit systems," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 43-57.
    7. Chen, Kang & Yang, Zhongzhen & Notteboom, Theo, 2014. "The design of coastal shipping services subject to carbon emission reduction targets and state subsidy levels," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 192-211.
    8. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    9. Codina, Esteve & Rosell, Francisca, 2017. "A heuristic method for a congested capacitated transit assignment model with strategies," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 293-320.
    10. Hamdouch, Younes & Szeto, W.Y. & Jiang, Y., 2014. "A new schedule-based transit assignment model with travel strategies and supply uncertainties," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 35-67.
    11. Cortés, Cristián E. & Donoso, Pedro & Gutiérrez, Leonel & Herl, Daniel & Muñoz, Diego, 2023. "A recursive stochastic transit equilibrium model estimated using passive data from Santiago, Chile," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    12. Wen Hua & Ghim Ping Ong, 2018. "Effect of information contagion during train service disruption for an integrated rail-bus transit system," Public Transport, Springer, vol. 10(3), pages 571-594, December.
    13. Du, Muqing & Chen, Anthony, 2022. "Sensitivity analysis for transit equilibrium assignment and applications to uncertainty analysis," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 175-202.
    14. Cortés, Cristián E. & Jara-Moroni, Pedro & Moreno, Eduardo & Pineda, Cristobal, 2013. "Stochastic transit equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 51(C), pages 29-44.
    15. Zhuo, Siyu & Zhu, Xiaoning & Shang, Pan & Liu, Zhengke & Yao, Yu & Liao, Feixiong, 2024. "Behavior-Adaptive Sync-Flow Framework: Integrating frequency setting and passenger routing in oversaturated urban rail transit networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 189(C).
    16. Valentina Trozzi & Guido Gentile & Ioannis Kaparias & Michael Bell, 2015. "Effects of Countdown Displays in Public Transport Route Choice Under Severe Overcrowding," Networks and Spatial Economics, Springer, vol. 15(3), pages 823-842, September.
    17. Hamdouch, Younes & Ho, H.W. & Sumalee, Agachai & Wang, Guodong, 2011. "Schedule-based transit assignment model with vehicle capacity and seat availability," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1805-1830.
    18. Sun, S. & Szeto, W.Y., 2018. "Logit-based transit assignment: Approach-based formulation and paradox revisit," Transportation Research Part B: Methodological, Elsevier, vol. 112(C), pages 191-215.
    19. Khani, Alireza, 2019. "An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 549-564.
    20. Trozzi, Valentina & Gentile, Guido & Bell, Michael G.H. & Kaparias, Ioannis, 2013. "Dynamic user equilibrium in public transport networks with passenger congestion and hyperpaths," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 266-285.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:10:y:2018:i:6:p:1752-:d:149189. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.