IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v628y2023ics0378437123007306.html
   My bibliography  Save this article

A new approach on passenger flow assignment with multi-connected agents

Author

Listed:
  • Yu, Liping
  • Liu, Huiran
  • Fang, Zhiming
  • Ye, Rui
  • Huang, Zhongyi
  • You, Yayun

Abstract

Efficient passenger flow assignment is essential for ensuring the safe and stable operation of the urban rail transit (URT). This paper proposes a new passenger flow assignment approach to address this challenge. The approach generates two agents: connected vehicle and unconnected passenger, to simulate vehicle operation and passenger travel for the URT network. It derives the passenger trajectory by the passenger route evolution mechanism to achieve the passenger flow assignment for the whole network. Furthermore, it provides statistics on platform passenger flow when obtaining the overall station passenger flow. Meanwhile, the approach employed Automatic Fare Collection (AFC) data as input to analyze the passenger flow features of the Shanghai Metro. The passenger flow assignment results can reveal the start and end of morning and evening peak hours at a time granularity of seconds. That is, 7:16:20 and 9:33:00 for the morning peak and 16:49:00 and 19:22:50 for the evening peak, respectively. The results also reveal the route choice pattern of passengers. Passengers have preferences for each type of route, in descending order: the shortest route, the minimum number of stations route, and the minimum number of transfer stations route, when they have a choice of these three routes. Moreover, the results can accurately identify large passenger flow stations and provide data support for station passenger flow management strategies.

Suggested Citation

  • 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).
  • Handle: RePEc:eee:phsmap:v:628:y:2023:i:c:s0378437123007306
    DOI: 10.1016/j.physa.2023.129175
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437123007306
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2023.129175?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Zhou, Yu & Yang, Hai & Wang, Yun & Yan, Xuedong, 2021. "Integrated line configuration and frequency determination with passenger path assignment in urban rail transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 145(C), pages 134-151.
    3. Wu, Jianjun & Qu, Yunchao & Sun, Huijun & Yin, Haodong & Yan, Xiaoyong & Zhao, Jiandong, 2019. "Data-driven model for passenger route choice in urban metro network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 524(C), pages 787-798.
    4. Lianbo Deng & Junhao Zeng & Hongda Mei, 2019. "Passenger Flow Pushing Assignment Method for an Urban Rail Network Based on Hierarchical Path and Line Decomposition," Sustainability, MDPI, vol. 11(22), pages 1-21, November.
    5. Ding, Heng & Di, Yunran & Zheng, Xiaoyan & Liu, Kai & Zhang, Weihua & Zheng, Lingling, 2021. "Passenger arrival distribution model and riding guidance on an urban rail transit platform," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 571(C).
    6. Xie, J. & Wong, S.C. & Zhan, S. & Lo, S.M. & Chen, Anthony, 2020. "Train schedule optimization based on schedule-based stochastic passenger assignment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    7. 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.
    8. Kai Lu & Nan Cao & Jing-Hu Pan, 2022. "Passenger Behavior Simulation in Congested Urban Rail Transit System: A Capacity-Limited Optimal Strategy Model for Passenger Assignment," Complexity, Hindawi, vol. 2022, pages 1-13, January.
    9. Zhou, Yuyang & Zheng, Shuyan & Hu, Zhonghui & Chen, Yanyan, 2022. "Metro station risk classification based on smart card data: A case study in Beijing," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 594(C).
    10. Sang Nguyen & Stefano Pallottino & Federico Malucelli, 2001. "A Modeling Framework for Passenger Assignment on a Transport Network with Timetables," Transportation Science, INFORMS, vol. 35(3), pages 238-249, August.
    11. 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.
    12. 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.
    13. Mo, Baichuan & Koutsopoulos, Haris N. & Zhao, Jinhua, 2022. "Inferring passenger responses to urban rail disruptions using smart card data: A probabilistic framework," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    14. Hörcher, Daniel & Graham, Daniel J. & Anderson, Richard J., 2017. "Crowding cost estimation with large scale smart card and vehicle location data," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 105-125.
    15. Agostino Nuzzolo & Francesco Russo & Umberto Crisalli, 2001. "A Doubly Dynamic Schedule-based Assignment Model for Transit Networks," Transportation Science, INFORMS, vol. 35(3), pages 268-285, August.
    16. Xia, Dawen & Jiang, Shunying & Yang, Nan & Hu, Yang & Li, Yantao & Li, Huaqing & Wang, Lin, 2021. "Discovering spatiotemporal characteristics of passenger travel with mobile trajectory big data," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    Full references (including those not matched with items on IDEAS)

    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. Luan, Xiaojie & Corman, Francesco, 2022. "Passenger-oriented traffic control for rail networks: An optimization model considering crowding effects on passenger choices and train operations," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 239-272.
    2. 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.
    3. Yu, Chao & Li, Haiying & Xu, Xinyue & Liu, Jun, 2020. "Data-driven approach for solving the route choice problem with traveling backward behavior in congested metro systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    4. Alireza Khani & Mark Hickman & Hyunsoo Noh, 2015. "Trip-Based Path Algorithms Using the Transit Network Hierarchy," Networks and Spatial Economics, Springer, vol. 15(3), pages 635-653, September.
    5. 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).
    6. Mohamed Wahba & Amer Shalaby, 2011. "Large-scale application of MILATRAS: case study of the Toronto transit network," Transportation, Springer, vol. 38(6), pages 889-908, November.
    7. Yin, Dezhi & Huang, Wencheng & Shuai, Bin & Liu, Hongyi & Zhang, Yue, 2022. "Structural characteristics analysis and cascading failure impact analysis of urban rail transit network: From the perspective of multi-layer network," Reliability Engineering and System Safety, Elsevier, vol. 218(PA).
    8. Guangming Xu & Shuo Zhao & Feng Shi & Feilian Zhang, 2017. "Cell transmission model of dynamic assignment for urban rail transit networks," PLOS ONE, Public Library of Science, vol. 12(11), pages 1-31, November.
    9. 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.
    10. Cai Jia & Shuyan Zheng & Hanqiang Qian & Bingxin Cao & Kaiting Zhang, 2022. "Analysis of Crowded Propagation on the Metro Network," Sustainability, MDPI, vol. 14(16), pages 1-12, August.
    11. Cats, Oded & Koutsopoulos, Haris N. & Burghout, Wilco & Toledo, Tomer, 2013. "Effect of real-time transit information on dynamic path choice of passengers," Working papers in Transport Economics 2013:28, CTS - Centre for Transport Studies Stockholm (KTH and VTI).
    12. Gardner, Clara Brimnes & Nielsen, Sara Dorthea & Eltved, Morten & Rasmussen, Thomas Kjær & Nielsen, Otto Anker & Nielsen, Bo Friis, 2021. "Calculating conditional passenger travel time distributions in mixed schedule- and frequency-based public transport networks using Markov chains," Transportation Research Part B: Methodological, Elsevier, vol. 152(C), pages 1-17.
    13. Zhi-Chun Li & William Lam & S. Wong & A. Sumalee, 2010. "An activity-based approach for scheduling multimodal transit services," Transportation, Springer, vol. 37(5), pages 751-774, September.
    14. Jiang, Y. & Szeto, W.Y., 2016. "Reliability-based stochastic transit assignment: Formulations and capacity paradox," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 181-206.
    15. 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.
    16. 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.
    17. Liu, Jiangtao & Zhou, Xuesong, 2016. "Capacitated transit service network design with boundedly rational agents," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 225-250.
    18. Hänseler, Flurin S. & van den Heuvel, Jeroen P.A. & Cats, Oded & Daamen, Winnie & Hoogendoorn, Serge P., 2020. "A passenger-pedestrian model to assess platform and train usage from automated data," Transportation Research Part A: Policy and Practice, Elsevier, vol. 132(C), pages 948-968.
    19. 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.
    20. 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.

    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:eee:phsmap:v:628:y:2023:i:c:s0378437123007306. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.