IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0183135.html
   My bibliography  Save this article

Selfish routing equilibrium in stochastic traffic network: A probability-dominant description

Author

Listed:
  • Wenyi Zhang
  • Zhengbing He
  • Wei Guan
  • Rui Ma

Abstract

This paper suggests a probability-dominant user equilibrium (PdUE) model to describe the selfish routing equilibrium in a stochastic traffic network. At PdUE, travel demands are only assigned to the most dominant routes in the same origin-destination pair. A probability-dominant rerouting dynamic model is proposed to explain the behavioral mechanism of PdUE. To facilitate applications, the logit formula of PdUE is developed, of which a well-designed route set is not indispensable and the equivalent varitional inequality formation is simple. Two routing strategies, i.e., the probability-dominant strategy (PDS) and the dominant probability strategy (DPS), are discussed through a hypothetical experiment. It is found that, whether out of insurance or striving for perfection, PDS is a better choice than DPS. For more general cases, the conducted numerical tests lead to the same conclusion. These imply that PdUE (rather than the conventional stochastic user equilibrium) is a desirable selfish routing equilibrium for a stochastic network, given that the probability distributions of travel time are available to travelers.

Suggested Citation

  • 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.
    • Handle: RePEc:plo:pone00:0183135
    DOI: 10.1371/journal.pone.0183135
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0183135
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0183135&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0183135?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
    ---><---

    References listed on IDEAS

    as
    1. Akamatsu, Takashi, 1996. "Cyclic flows, Markov process and stochastic traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 30(5), pages 369-386, October.
    2. Carlos F. Daganzo & Yosef Sheffi, 1977. "On Stochastic Models of Traffic Assignment," Transportation Science, INFORMS, vol. 11(3), pages 253-274, August.
    3. 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.
    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. 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. 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.
    3. 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.
    4. 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).
    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. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Fiore Tinessa & Vittorio Marzano & Andrea Papola, 2021. "Choice probabilities and correlations in closed-form route choice models: specifications and drawbacks," Papers 2110.07224, arXiv.org.
    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. Nirmale, Sangram Krishna & Pinjari, Abdul Rawoof, 2023. "Discrete choice models with multiplicative stochasticity in choice environment variables: Application to accommodating perception errors in driver behaviour models," Transportation Research Part B: Methodological, Elsevier, vol. 170(C), pages 169-193.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. Mogens Fosgerau & Nikolaj Nielsen & Mads Paulsen & Thomas Kj{ae}r Rasmussen & Rui Yao, 2024. "Substitution in the perturbed utility route choice model," Papers 2409.08347, arXiv.org.
    18. Yao, Jia & Chen, Anthony, 2014. "An analysis of logit and weibit route choices in stochastic assignment paradox," Transportation Research Part B: Methodological, Elsevier, vol. 69(C), pages 31-49.
    19. Xu, Xiangdong & Chen, Anthony & Kitthamkesorn, Songyot & Yang, Hai & Lo, Hong K., 2015. "Modeling absolute and relative cost differences in stochastic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P3), pages 686-703.
    20. Gu, Yu & Chen, Anthony & Kitthamkesorn, Songyot, 2022. "Weibit choice models: Properties, mode choice application and graphical illustrations," Journal of choice modelling, Elsevier, vol. 44(C).

    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:plo:pone00:0183135. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.