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

Stochastic user equilibrium assignment in networks with queues

Author

Listed:
  • Bell, Michael G. H.

Abstract

A stochastic user equilibrium assignment algorithm is presented for steady state store-and-forward networks. The links of the network have constant travel times and the links or nodes have finite capacities. When capacity is reached, delay sufficient to match demand to the available capacity is generated. It has been shown by others that the equilibrium assignment in networks of this kind is the solution to a particular linear programming problem. By adding an entropy term to the objective function, a convex nonlinear programming problem is formed which yields a stochastic user equilibrium assignment. For the case of link constraints, it is proven that the Lagrange multipliers of both the linear and the non-linear programming problems give the equilibrium delays in the network. The requirements for uniqueness are investigated. Iterative algorithms are formulated for solving the nonlinear programming problem with either link or node constraints and convergence is proven. For networks where path enumeration is likely to be a problem, a column generation technique is proposed. An illustrative example is presented.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:29:y:1995:i:2:p:125-137
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(94)00030-4
    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. Carlos F. Daganzo, 1982. "Unconstrained Extremal Formulation of Some Transportation Equilibrium Problems," Transportation Science, INFORMS, vol. 16(3), pages 332-360, August.
    3. Newell, Gordon F., 1989. "Theory of highway traffic signals," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt7zn2b9bc, Institute of Transportation Studies, UC Berkeley.
    4. Erlander, S. & Nguyen, S. & Stewart, N. F., 1979. "On the calibration of the combined distribution-assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 13(3), pages 259-267, September.
    5. 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. 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.
    2. Watling, David Paul & Rasmussen, Thomas Kjær & Prato, Carlo Giacomo & Nielsen, Otto Anker, 2015. "Stochastic user equilibrium with equilibrated choice sets: Part I – Model formulations under alternative distributions and restrictions," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 166-181.
    3. 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.
    4. 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.
    5. 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.
    6. Castillo, Enrique & Menéndez, José María & Sánchez-Cambronero, Santos, 2008. "Predicting traffic flow using Bayesian networks," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 482-509, June.
    7. 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.
    8. Jiayang Li & Zhaoran Wang & Yu Marco Nie, 2023. "Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice," Papers 2304.02500, arXiv.org, revised Feb 2024.
    9. Paolo Delle Site, 2017. "On the Equivalence Between SUE and Fixed-Point States of Day-to-Day Assignment Processes with Serially-Correlated Route Choice," Networks and Spatial Economics, Springer, vol. 17(3), pages 935-962, September.
    10. Kobayashi, Kiyoshi & Do, Myungsik, 2005. "The informational impacts of congestion tolls upon route traffic demands," Transportation Research Part A: Policy and Practice, Elsevier, vol. 39(7-9), pages 651-670.
    11. Honggang Zhang & Zhiyuan Liu & Yicheng Zhang & Weijie Chen & Chenyang Zhang, 2024. "A Distributed Computing Method Integrating Improved Gradient Projection for Solving Stochastic Traffic Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 24(2), pages 361-381, June.
    12. Hamid Reza Eftekhari & Mehdi Ghatee, 2017. "The lower bound for dynamic parking prices to decrease congestion through CBD," Operational Research, Springer, vol. 17(3), pages 761-787, October.
    13. S. F. A. Batista & Ludovic Leclercq, 2019. "Regional Dynamic Traffic Assignment Framework for Macroscopic Fundamental Diagram Multi-regions Models," Transportation Science, INFORMS, vol. 53(6), pages 1563-1590, November.
    14. Yao, Jia & Chen, Anthony & Ryu, Seungkyu & Shi, Feng, 2014. "A general unconstrained optimization formulation for the combined distribution and assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 137-160.
    15. Wang, Judith Y.T. & Ehrgott, Matthias, 2013. "Modelling route choice behaviour in a tolled road network with a time surplus maximisation bi-objective user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 342-360.
    16. Kitthamkesorn, Songyot & Chen, Anthony, 2013. "A path-size weibit stochastic user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 378-397.
    17. Bliemer, Michiel C.J. & Raadsen, Mark P.H. & Smits, Erik-Sander & Zhou, Bojian & Bell, Michael G.H., 2014. "Quasi-dynamic traffic assignment with residual point queues incorporating a first order node model," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 363-384.
    18. Amirgholy, Mahyar & Gonzales, Eric J., 2017. "Efficient frontier of route choice for modeling the equilibrium under travel time variability with heterogeneous traveler preferences," Economics of Transportation, Elsevier, vol. 11, pages 1-14.
    19. Zhang, Michael & Nie, Yu & Shen, Wei & Lee, Ming S. & Jansuwan, Sarawut & Chootinan, Piya & Pravinvongvuth, Surachet & Chen, Anthony & Recker, Will W., 2008. "Development of A Path Flow Estimator for Inferring Steady-State and Time-Dependent Origin-Destination Trip Matrices," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3nr033sc, Institute of Transportation Studies, UC Berkeley.
    20. Luis Briceño & Roberto Cominetti & Cristián Cortés & Francisco Martínez, 2008. "An Integrated Behavioral Model of Land Use and Transport System: A Hyper-network Equilibrium Approach," Networks and Spatial Economics, Springer, vol. 8(2), pages 201-224, September.

    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:29:y:1995:i:2:p:125-137. 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.