IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v45y2011i10p1805-1830.html
   My bibliography  Save this article

Schedule-based transit assignment model with vehicle capacity and seat availability

Author

Listed:
  • Hamdouch, Younes
  • Ho, H.W.
  • Sumalee, Agachai
  • Wang, Guodong

Abstract

In this paper, we propose a new schedule-based equilibrium transit assignment model that differentiates the discomfort level experienced by sitting and standing passengers. The notion of seat allocation has not been considered explicitly and analytically in previous schedule-based frameworks. The model assumes that passengers use strategies when traveling from their origin to their destination. When loading a vehicle, standing on-board passengers continuing to the next station have priority to get available seats and waiting passengers are loaded on a First-Come-First-Serve (FCFS) principle. The stimulus of a standing passenger to sit increases with his/her remaining journey length and time already spent on-board. When a vehicle is full, passengers unable to board must wait for the next vehicle to arrive. The equilibrium conditions can be stated as a variational inequality involving a vector-valued function of expected strategy costs. To find a solution, we adopt the method of successive averages (MSA) that generates strategies during each iteration by solving a dynamic program. Numerical results are also reported to show the effects of our model on the travel strategies and departure time choices of passengers.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:45:y:2011:i:10:p:1805-1830
    DOI: 10.1016/j.trb.2011.07.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S019126151100110X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2011.07.010?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. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    3. Jia Hao Wu & Michael Florian & Patrice Marcotte, 1994. "Transit Equilibrium Assignment: A Model and Solution Algorithms," Transportation Science, INFORMS, vol. 28(3), pages 193-203, August.
    4. 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.
    5. Sumalee, Agachai & Tan, Zhijia & Lam, William H.K., 2009. "Dynamic stochastic transit assignment with explicit seat allocation model," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 895-912, September.
    6. Tian, Qiong & Huang, Hai-Jun & Yang, Hai, 2007. "Equilibrium properties of the morning peak-period commuting in a many-to-one mass transit system," Transportation Research Part B: Methodological, Elsevier, vol. 41(6), pages 616-631, July.
    7. Lo, Hong K. & Yip, C. W. & Wan, K. H., 2003. "Modeling transfer and non-linear fare structure in multi-modal network," Transportation Research Part B: Methodological, Elsevier, vol. 37(2), pages 149-170, February.
    8. Tong, C.O. & Wong, S.C., 1998. "A stochastic transit assignment model using a dynamic schedule-based network," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 107-121, April.
    9. Alfa, Attahiru Sule & Chen, Mingyuan, 1995. "Temporal distribution of public transport demand during the peak period," European Journal of Operational Research, Elsevier, vol. 83(1), pages 137-153, May.
    10. 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.
    11. Lam, W. H. K. & Gao, Z. Y. & Chan, K. S. & Yang, H., 1999. "A stochastic user equilibrium assignment model for congested transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 33(5), pages 351-368, June.
    12. 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.
    13. Sumi, Tomonori & Matsumoto, Yoshiji & Miyaki, Yasuyuki, 1990. "Departure time and route choice of commuters on mass transit systems," Transportation Research Part B: Methodological, Elsevier, vol. 24(4), pages 247-262, August.
    14. 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.
    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. 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.
    2. 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.
    3. 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.
    4. Sumalee, Agachai & Tan, Zhijia & Lam, William H.K., 2009. "Dynamic stochastic transit assignment with explicit seat allocation model," Transportation Research Part B: Methodological, Elsevier, vol. 43(8-9), pages 895-912, September.
    5. 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.
    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. 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.
    8. Donghyung Yook & Kevin Heaslip, 2015. "The effect of crowding on public transit user travel behavior in a large-scale public transportation system through modeling daily variations," Transportation Planning and Technology, Taylor & Francis Journals, vol. 38(8), pages 935-953, December.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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).
    14. 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.
    15. 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.
    16. 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).
    17. Binder, Stefan & Maknoon, Yousef & Bierlaire, Michel, 2017. "Exogenous priority rules for the capacitated passenger assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 19-42.
    18. Wang, Zhichao & Jiang, Rui & Jiang, Yu & Gao, Ziyou & Liu, Ronghui, 2024. "Modelling bus bunching along a common line corridor considering passenger arrival time and transfer choice under stochastic travel time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    19. Wang, Shuaian & Qu, Xiaobo, 2017. "Station choice for Australian commuter rail lines: Equilibrium and optimal fare design," European Journal of Operational Research, Elsevier, vol. 258(1), pages 144-154.
    20. Szeto, W.Y. & Jiang, Y., 2014. "Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 235-263.

    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:transb:v:45:y:2011:i:10:p:1805-1830. 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.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.