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

A stochastic user equilibrium assignment model for congested transit networks

Author

Listed:
  • Lam, W. H. K.
  • Gao, Z. Y.
  • Chan, K. S.
  • Yang, H.

Abstract

This paper proposes a stochastic user equilibrium assignment model for congested transit networks, together with a solution algorithm. A mathematical programming problem is formulated, that is equivalent to the stochastic user equilibrium assignment model for congested transit system. When the transit link capacity constraints are reached, it is proven that the Lagrange multipliers of the mathematical programming problem are equivalent to the equilibrium passenger overload delays in the congested transit network. The proposed model can simultaneously predict how passengers will choose their optimal routes and estimate the total passenger travel cost in a congested transit network. Numerical examples are used to illustrate the applications of the proposed model.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:33:y:1999:i:5:p:351-368
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(98)00040-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Fisk, Caroline, 1980. "Some developments in equilibrium traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 14(3), pages 243-255, September.
    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. Mingyuan Chen & Attahiru Sule Alfa, 1991. "Algorithms for solving fisk's stochastic traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 25(6), pages 405-412, December.
    5. Bell, Michael G. H., 1995. "Stochastic user equilibrium assignment in networks with queues," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 125-137, April.
    6. Carlos F. Daganzo & Yosef Sheffi, 1977. "On Stochastic Models of Traffic Assignment," Transportation Science, INFORMS, vol. 11(3), pages 253-274, 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. 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).
    2. Lam, William H. K. & Zhou, Jing & Sheng, Zhao-han, 2002. "A capacity restraint transit assignment with elastic line frequency," Transportation Research Part B: Methodological, Elsevier, vol. 36(10), pages 919-938, December.
    3. 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.
    4. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.
    5. 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.
    6. Maher, M. J. & Hughes, P. C., 1997. "A probit-based stochastic user equilibrium assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 341-355, August.
    7. Hazelton, Martin L., 2022. "The emergence of stochastic user equilibria in day-to-day traffic models," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 102-112.
    8. Oyama, Yuki & Hara, Yusuke & Akamatsu, Takashi, 2022. "Markovian traffic equilibrium assignment based on network generalized extreme value model," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 135-159.
    9. Arampatzis, G. & Kiranoudis, C. T. & Scaloubacas, P. & Assimacopoulos, D., 2004. "A GIS-based decision support system for planning urban transportation policies," European Journal of Operational Research, Elsevier, vol. 152(2), pages 465-475, January.
    10. Guido Gentile, 2018. "New Formulations of the Stochastic User Equilibrium with Logit Route Choice as an Extension of the Deterministic Model," Service Science, INFORMS, vol. 52(6), pages 1531-1547, December.
    11. Bekhor, Shlomo & Toledo, Tomer, 2005. "Investigating path-based solution algorithms to the stochastic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 39(3), pages 279-295, March.
    12. Damberg, Olof & Lundgren, Jan T. & Patriksson, Michael, 1996. "An algorithm for the stochastic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 30(2), pages 115-131, April.
    13. Guarda, Pablo & Qian, Sean, 2024. "Statistical inference of travelers’ route choice preferences with system-level data," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    14. Nielsen, Otto Anker, 2000. "A stochastic transit assignment model considering differences in passengers utility functions," Transportation Research Part B: Methodological, Elsevier, vol. 34(5), pages 377-402, June.
    15. Zhou, Bojian & Li, Xuhong & He, Jie, 2014. "Exploring trust region method for the solution of logit-based stochastic user equilibrium problem," European Journal of Operational Research, Elsevier, vol. 239(1), pages 46-57.
    16. Leurent, Fabien M., 1997. "Curbing the computational difficulty of the logit equilibrium assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 315-326, August.
    17. 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).
    18. Ahipaşaoğlu, Selin Damla & Meskarian, Rudabeh & Magnanti, Thomas L. & Natarajan, Karthik, 2015. "Beyond normality: A cross moment-stochastic user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 333-354.
    19. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    20. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.

    More about this item

    Statistics

    Access and download statistics

    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:33:y:1999:i:5:p:351-368. 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.