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

Stochastic user equilibrium with equilibrated choice sets: Part II – Solving the restricted SUE for the logit family

Author

Listed:
  • Rasmussen, Thomas Kjær
  • Watling, David Paul
  • Prato, Carlo Giacomo
  • Nielsen, Otto Anker

Abstract

We propose a new class of path-based solution algorithms to solve the Restricted Stochastic User Equilibrium (RSUE), as introduced in Watling et al. (2015). The class allows a flexible specification of how the choice sets are systematically grown by considering congestion effects and how the flows are allocated among routes. The specification allows adapting traditional path-based stochastic user equilibrium flow allocation methods (originally designed for pre-specified choice sets) to the generic solution algorithm. We also propose a cost transformation function and show that by using this we can, for certain Logit-type choice models, modify existing path-based Deterministic User Equilibrium solution methods to compute RSUE solutions. The transformation function also leads to a two-part relative gap measure for consistently monitoring convergence to a RSUE solution. Numerical tests are reported on two real-life cases, in which we explore convergence patterns and choice set composition and size, for alternative specifications of the RSUE model and solution algorithm.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:77:y:2015:i:c:p:146-165
    DOI: 10.1016/j.trb.2015.03.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261515000521
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2015.03.009?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. van der Zijpp, N.J. & Fiorenzo Catalano, S., 2005. "Path enumeration by finding the constrained K-shortest paths," Transportation Research Part B: Methodological, Elsevier, vol. 39(6), pages 545-563, July.
    2. Frejinger, E. & Bierlaire, M. & Ben-Akiva, M., 2009. "Sampling of alternatives for route choice modeling," Transportation Research Part B: Methodological, Elsevier, vol. 43(10), pages 984-994, December.
    3. 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.
    4. Richard Connors & David Watling, 2015. "Assessing the Demand Vulnerability of Equilibrium Traffic Networks via Network Aggregation," Networks and Spatial Economics, Springer, vol. 15(2), pages 367-395, June.
    5. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    6. Han, Sangjin, 2007. "A route-based solution algorithm for dynamic user equilibrium assignments," Transportation Research Part B: Methodological, Elsevier, vol. 41(10), pages 1094-1113, December.
    7. Giulio Erberto Cantarella, 1997. "A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand," Transportation Science, INFORMS, vol. 31(2), pages 107-128, May.
    8. Bekhor, Shlomo & Prato, Carlo Giacomo, 2009. "Methodological transferability in route choice modeling," Transportation Research Part B: Methodological, Elsevier, vol. 43(4), pages 422-437, May.
    9. 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.
    10. Torbjörn Larsson & Michael Patriksson, 1992. "Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 26(1), pages 4-17, February.
    11. Malachy Carey & Y. Ge, 2012. "Comparison of Methods for Path Flow Reassignment for Dynamic User Equilibrium," Networks and Spatial Economics, Springer, vol. 12(3), pages 337-376, September.
    12. Akgun, Vedat & Erkut, Erhan & Batta, Rajan, 2000. "On finding dissimilar paths," European Journal of Operational Research, Elsevier, vol. 121(2), pages 232-246, March.
    13. 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.
    14. Rose, Geoffrey & Daskin, Mark S. & Koppelman, Frank S., 1988. "An examination of convergence error in equilibrium traffic assignment models," Transportation Research Part B: Methodological, Elsevier, vol. 22(4), pages 261-274, August.
    15. 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.
    16. Azevedo, JoseAugusto & Santos Costa, Maria Emilia O. & Silvestre Madeira, Joaquim Joao E. R. & Vieira Martins, Ernesto Q., 1993. "An algorithm for the ranking of shortest paths," European Journal of Operational Research, Elsevier, vol. 69(1), pages 97-106, August.
    17. 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.
    18. Xiangdong Xu & Anthony Chen, 2013. "C-logit stochastic user equilibrium model with elastic demand," Transportation Planning and Technology, Taylor & Francis Journals, vol. 36(5), pages 463-478, July.
    19. Chen, Anthony & Lee, Der-Horng & Jayakrishnan, R., 2002. "Computational study of state-of-the-art path-based traffic assignment algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 59(6), pages 509-518.
    20. Mounce, Richard & Carey, Malachy, 2011. "Route swapping in dynamic traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 102-111, January.
    21. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    22. Carlos F. Daganzo & Yosef Sheffi, 1977. "On Stochastic Models of Traffic Assignment," Transportation Science, INFORMS, vol. 11(3), pages 253-274, August.
    23. 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.
    24. Castillo, Enrique & Menéndez, José María & Jiménez, Pilar & Rivas, Ana, 2008. "Closed form expressions for choice probabilities in the Weibull case," Transportation Research Part B: Methodological, Elsevier, vol. 42(4), pages 373-380, May.
    25. 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.
    26. 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.
    27. 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.
    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. Rasulkhani, Saeid & Chow, Joseph Y.J., 2019. "Route-cost-assignment with joint user and operator behavior as a many-to-one stable matching assignment game," Transportation Research Part B: Methodological, Elsevier, vol. 124(C), pages 60-81.
    2. 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.
    3. Ma, Jie & Meng, Qiang & Cheng, Lin & Liu, Zhiyuan, 2022. "General stochastic ridesharing user equilibrium problem with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 162-194.
    4. Watling, David Paul & Rasmussen, Thomas Kjær & Prato, Carlo Giacomo & Nielsen, Otto Anker, 2018. "Stochastic user equilibrium with a bounded choice model," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 254-280.
    5. 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.
    6. 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.
    7. Larsen, Rune & Rich, Jeppe & Rasmussen, Thomas Kjær, 2019. "Hub-based truck platooning: Potentials and profitability," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 249-264.
    8. 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.

    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. 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.
    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. 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.
    4. 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.
    5. Li, Guoyuan & Chen, Anthony, 2023. "Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints," European Journal of Operational Research, Elsevier, vol. 305(1), pages 164-183.
    6. Ampol Karoonsoontawong & Dung-Ying Lin, 2015. "Combined Gravity Model Trip Distribution and Paired Combinatorial Logit Stochastic User Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 15(4), pages 1011-1048, December.
    7. Ma, Jie & Meng, Qiang & Cheng, Lin & Liu, Zhiyuan, 2022. "General stochastic ridesharing user equilibrium problem with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 162-194.
    8. Kitthamkesorn, Songyot & Chen, Anthony, 2017. "Alternate weibit-based model for assessing green transport systems with combined mode and route travel choices," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 291-310.
    9. Chen, Anthony & Choi, Keechoo, 2017. "Solving the combined modal split and traffic assignment problem with two types of transit impedance functionAuthor-Name: Ryu, Seungkyu," European Journal of Operational Research, Elsevier, vol. 257(3), pages 870-880.
    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. 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. Meng, Qiang & Liu, Zhiyuan & Wang, Shuaian, 2012. "Optimal distance tolls under congestion pricing and continuously distributed value of time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(5), pages 937-957.
    14. 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.
    15. Damla Ahipaşaoğlu, Selin & Arıkan, Uğur & Natarajan, Karthik, 2016. "On the flexibility of using marginal distribution choice models in traffic equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 130-158.
    16. 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.
    17. 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.
    18. Ji, Xiangfeng & Chu, Yanyu, 2020. "A target-oriented bi-attribute user equilibrium model with travelers’ perception errors on the tolled traffic network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    19. Songyot Kitthamkesorn & Anthony Chen & Sathaporn Opasanon & Suwicha Jaita, 2021. "A P-Hub Location Problem for Determining Park-and-Ride Facility Locations with the Weibit-Based Choice Model," Sustainability, MDPI, vol. 13(14), pages 1-16, July.
    20. Evanthia Kazagli & Michel Bierlaire & Matthieu de Lapparent, 2020. "Operational route choice methodologies for practical applications," Transportation, Springer, vol. 47(1), pages 43-74, February.

    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:77:y:2015:i:c:p:146-165. 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.