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

A study on logit assignment which excludes all cyclic flows

Author

Listed:
  • Huang, Hai-Jun
  • Bell, Michael G. H.

Abstract

This paper first studies the Van Vliet formula in calculating the link choice probabilities for the logit assignment without cyclic flows. We show that this formula may still contain the cyclic flow contribution although the node-to-node weights matrix used in it does not. The correct formula is provided but with the need for path enumeration. The paper then presents an efficient approach to generate all non-looping paths and applies it to solve stochastic user equilibrium problem in conjunction with the method of successive averages. A numerical example is used to validate our study.

Suggested Citation

  • Huang, Hai-Jun & Bell, Michael G. H., 1998. "A study on logit assignment which excludes all cyclic flows," Transportation Research Part B: Methodological, Elsevier, vol. 32(6), pages 401-412, August.
    • Handle: RePEc:eee:transb:v:32:y:1998:i:6:p:401-412
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(98)00008-3
    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. Warren B. Powell & Yosef Sheffi, 1982. "The Convergence of Equilibrium Algorithms with Predetermined Step Sizes," Transportation Science, INFORMS, vol. 16(1), pages 45-55, February.
    3. Takashi Akamatsu, 1997. "Decomposition of Path Choice Entropy in General Transport Networks," Transportation Science, INFORMS, vol. 31(4), pages 349-362, November.
    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. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    6. Van Vliet, Dirck, 1981. "Selected node-pair analysis in dial's assignment algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 15(1), pages 65-68, February.
    7. 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.
    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. Chen, Anthony & Pravinvongvuth, Surachet & Xu, Xiangdong & Ryu, Seungkyu & Chootinan, Piya, 2012. "Examining the scaling effect and overlapping problem in logit-based stochastic user equilibrium models," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(8), pages 1343-1358.
    2. Huang, Hai-Jun & Li, Zhi-Chun, 2007. "A multiclass, multicriteria logit-based traffic equilibrium assignment model under ATIS," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1464-1477, February.
    3. Wong, S. C., 1999. "On the convergence of Bell's logit assignment formulation," Transportation Research Part B: Methodological, Elsevier, vol. 33(8), pages 609-616, November.
    4. Long, Jiancheng & Szeto, W.Y. & Huang, Hai-Jun, 2014. "A bi-objective turning restriction design problem in urban road networks," European Journal of Operational Research, Elsevier, vol. 237(2), pages 426-439.
    5. Liu, Ke & Liu, Yanli, 2023. "Stochastic user equilibrium based spatial-temporal distribution prediction of electric vehicle charging load," Applied Energy, Elsevier, vol. 339(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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Maher, Mike, 1998. "Algorithms for logit-based stochastic user equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 539-549, November.
    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. Wong, S. C., 1999. "On the convergence of Bell's logit assignment formulation," Transportation Research Part B: Methodological, Elsevier, vol. 33(8), pages 609-616, November.
    9. Oyama, Yuki & Hato, Eiji, 2019. "Prism-based path set restriction for solving Markovian traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 528-546.
    10. Long, Jiancheng & Szeto, W.Y. & Huang, Hai-Jun, 2014. "A bi-objective turning restriction design problem in urban road networks," European Journal of Operational Research, Elsevier, vol. 237(2), pages 426-439.
    11. Chen, Anthony & Pravinvongvuth, Surachet & Xu, Xiangdong & Ryu, Seungkyu & Chootinan, Piya, 2012. "Examining the scaling effect and overlapping problem in logit-based stochastic user equilibrium models," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(8), pages 1343-1358.
    12. Lo, Hing-Po & Chan, Chi-Pak, 2003. "Simultaneous estimation of an origin-destination matrix and link choice proportions using traffic counts," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(9), pages 771-788, November.
    13. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    14. Selin Damla Ahipaşaoğlu & Uğur Arıkan & Karthik Natarajan, 2019. "Distributionally Robust Markovian Traffic Equilibrium," Transportation Science, INFORMS, vol. 53(6), pages 1546-1562, November.
    15. Xie, Chi & Travis Waller, S., 2012. "Stochastic traffic assignment, Lagrangian dual, and unconstrained convex optimization," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1023-1042.
    16. 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.
    17. 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).
    18. Tan, Heqing & Xu, Xiangdong & Chen, Anthony, 2024. "On endogenously distinguishing inactive paths in stochastic user equilibrium: A convex programming approach with a truncated path choice model," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    19. 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.
    20. 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.

    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:32:y:1998:i:6:p:401-412. 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.