IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v9y2009i4p485-503.html
   My bibliography  Save this article

Method of Successive Weighted Averages (MSWA) and Self-Regulated Averaging Schemes for Solving Stochastic User Equilibrium Problem

Author

Listed:
  • Henry Liu
  • Xiaozheng He
  • Bingsheng He

Abstract

No abstract is available for this item.

Suggested Citation

  • Henry Liu & Xiaozheng He & Bingsheng He, 2009. "Method of Successive Weighted Averages (MSWA) and Self-Regulated Averaging Schemes for Solving Stochastic User Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 9(4), pages 485-503, December.
  • Handle: RePEc:kap:netspa:v:9:y:2009:i:4:p:485-503
    DOI: 10.1007/s11067-007-9023-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11067-007-9023-x
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11067-007-9023-x?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. 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.
    2. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    3. 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. 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.
    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. 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.
    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. 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.
    6. 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.
    7. Maher, Mike, 1998. "Algorithms for logit-based stochastic user equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 539-549, November.
    8. 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.
    9. 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.
    10. Maëlle Zimmermann & Emma Frejinger & Patrice Marcotte, 2021. "A Strategic Markovian Traffic Equilibrium Model for Capacitated Networks," Transportation Science, INFORMS, vol. 55(3), pages 574-591, May.
    11. 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.
    12. Kitthamkesorn, Songyot & Chen, Anthony, 2014. "Unconstrained weibit stochastic user equilibrium model with extensions," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 1-21.
    13. 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.
    14. Rasmussen, Thomas Kjær & Watling, David Paul & Prato, Carlo Giacomo & Nielsen, Otto Anker, 2015. "Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 146-165.
    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. 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.
    18. Wenyi Zhang & Zhengbing He & Wei Guan & Rui Ma, 2017. "Selfish routing equilibrium in stochastic traffic network: A probability-dominant description," PLOS ONE, Public Library of Science, vol. 12(8), pages 1-13, August.
    19. Susan Jia Xu & Mehdi Nourinejad & Xuebo Lai & Joseph Y. J. Chow, 2018. "Network Learning via Multiagent Inverse Transportation Problems," Service Science, INFORMS, vol. 52(6), pages 1347-1364, December.
    20. 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.

    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:kap:netspa:v:9:y:2009:i:4:p:485-503. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.