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

Paradox links can improve system efficiency: An illustration in traffic assignment problem

Author

Listed:
  • Yao, Jia
  • Huang, Wenhua
  • Chen, Anthony
  • Cheng, Zhanhong
  • An, Shi
  • Xu, Guangming

Abstract

This paper demonstrates a counter-intuitive phenomenon that “paradox links” (i.e. marginally improving or adding these links will increase a system's cost) can sometimes decrease a system's cost. It can be expressed that simultaneously improving the paradox link to a certain threshold (rather than only marginal improvement) or adding more paradox links may counter-intuitively avoid the paradox. Here, we refer this phenomenon as the “non-monotonicity” of the paradox with regard to the degree of link improvement and the number of additional paradox links. Firstly, a formal definition of "non-monotonicity" property of paradox in a rigorous mathematical manner is proposed. Then this non-monotonicity property is demonstrated to widely exist in the user equilibrium (UE), the stochastic assignment, and the stochastic user equilibrium (SUE) models by two simple networks, where the underlying reasons for this phenomenon in different scenarios are analyzed and compared. Finally, the non-monotonicity of the traffic paradox is corroborated in a road sub-network of Harbin. The conclusions of this study provide new insights into features of traffic paradoxes and new ideas to eliminate them.

Suggested Citation

  • Yao, Jia & Huang, Wenhua & Chen, Anthony & Cheng, Zhanhong & An, Shi & Xu, Guangming, 2019. "Paradox links can improve system efficiency: An illustration in traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 35-49.
    • Handle: RePEc:eee:transb:v:129:y:2019:i:c:p:35-49
    DOI: 10.1016/j.trb.2019.07.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S019126151830571X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2019.07.018?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. Anna Nagurney & David Boyce, 2005. "Preface to “On a Paradox of Traffic Planning”," Transportation Science, INFORMS, vol. 39(4), pages 443-445, November.
    2. 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.
    3. Dietrich Braess & Anna Nagurney & Tina Wakolbinger, 2005. "On a Paradox of Traffic Planning," Transportation Science, INFORMS, vol. 39(4), pages 446-450, November.
    4. Sun, Li & Liu, Like & Xu, Zhongzhi & Jie, Yang & Wei, Dong & Wang, Pu, 2015. "Locating inefficient links in a large-scale transportation network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 537-545.
    5. Prashker, Joseph N. & Bekhor, Shlomo, 2000. "Some observations on stochastic user equilibrium and system optimum of traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 34(4), pages 277-291, May.
    6. 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.
    7. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2004. "Selfish Routing in Capacitated Networks," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 961-976, November.
    8. Richard Steinberg & Willard I. Zangwill, 1983. "The Prevalence of Braess' Paradox," Transportation Science, INFORMS, vol. 17(3), pages 301-318, August.
    9. 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.
    10. Terry L. Friesz & David Bernstein & Tony E. Smith & Roger L. Tobin & B. W. Wie, 1993. "A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem," Operations Research, INFORMS, vol. 41(1), pages 179-191, February.
    11. Hani S. Mahmassani & Gang-Len Chang, 1987. "On Boundedly Rational User Equilibrium in Transportation Systems," Transportation Science, INFORMS, vol. 21(2), pages 89-99, May.
    12. Zhao, Chunxue & Fu, Baibai & Wang, Tianming, 2014. "Braess paradox and robustness of traffic networks under stochastic user equilibrium," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 135-141.
    13. Yang, Hai & Bell, Michael G. H., 1998. "A capacity paradox in network design and how to avoid it," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(7), pages 539-545, September.
    14. Di, Xuan & He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2014. "Braess paradox under the boundedly rational user equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 86-108.
    15. Pas, Eric I. & Principio, Shari L., 1997. "Braess' paradox: Some new insights," Transportation Research Part B: Methodological, Elsevier, vol. 31(3), pages 265-276, June.
    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. Ye, Jiao & Jiang, Yu & Chen, Jun & Liu, Zhiyuan & Guo, Renzhong, 2021. "Joint optimisation of transfer location and capacity for a capacitated multimodal transport network with elastic demand: a bi-level programming model and paradoxes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    2. Wang, Aihu & Tang, Yuanhua & Mohmand, Yasir Tariq & Xu, Pei, 2022. "Modifying link capacity to avoid Braess Paradox considering elastic demand," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 605(C).
    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.

    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. 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.
    2. Bagloee, Saeed Asadi & (Avi) Ceder, Avishai & Sarvi, Majid & Asadi, Mohsen, 2019. "Is it time to go for no-car zone policies? Braess Paradox Detection," Transportation Research Part A: Policy and Practice, Elsevier, vol. 121(C), pages 251-264.
    3. Wang, Wei (Walker) & Wang, David Z.W. & Zhang, Fangni & Sun, Huijun & Zhang, Wenyi & Wu, Jianjun, 2017. "Overcoming the Downs-Thomson Paradox by transit subsidy policies," Transportation Research Part A: Policy and Practice, Elsevier, vol. 95(C), pages 126-147.
    4. Bittihn, Stefan & Schadschneider, Andreas, 2021. "The effect of modern traffic information on Braess’ paradox," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 571(C).
    5. Wang, Aihu & Tang, Yuanhua & Mohmand, Yasir Tariq & Xu, Pei, 2022. "Modifying link capacity to avoid Braess Paradox considering elastic demand," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 605(C).
    6. Di, Xuan & He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2014. "Braess paradox under the boundedly rational user equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 86-108.
    7. Zhaolin Cheng & Laijun Zhao & Huiyong Li, 2020. "A Transportation Network Paradox: Consideration of Travel Time and Health Damage due to Pollution," Sustainability, MDPI, vol. 12(19), pages 1-22, October.
    8. Bittihn, Stefan & Schadschneider, Andreas, 2018. "Braess paradox in a network with stochastic dynamics and fixed strategies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 507(C), pages 133-152.
    9. Ye, Jiao & Jiang, Yu & Chen, Jun & Liu, Zhiyuan & Guo, Renzhong, 2021. "Joint optimisation of transfer location and capacity for a capacitated multimodal transport network with elastic demand: a bi-level programming model and paradoxes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    10. Ashraf, Muhammad Hasan & Chen, Yuwen & Yalcin, Mehmet G., 2022. "Minding Braess Paradox amid third-party logistics hub capacity expansion triggered by demand surge," International Journal of Production Economics, Elsevier, vol. 248(C).
    11. Takashi Akamatsu & Benjamin Heydecker, 2003. "Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks," Transportation Science, INFORMS, vol. 37(2), pages 123-138, May.
    12. Shanjiang Zhu & David Levinson & Henry Liu, 2017. "Measuring winners and losers from the new I-35W Mississippi River Bridge," Transportation, Springer, vol. 44(5), pages 905-918, September.
    13. Xiaoning Zhang & H. Zhang, 2010. "Simultaneous Departure Time/Route Choices in Queuing Networks and a Novel Paradox," Networks and Spatial Economics, Springer, vol. 10(1), pages 93-112, March.
    14. 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.
    15. Koohyun Park, 2011. "Detecting Braess Paradox Based on Stable Dynamics in General Congested Transportation Networks," Networks and Spatial Economics, Springer, vol. 11(2), pages 207-232, June.
    16. Liu, Jiangtao & Zhou, Xuesong, 2016. "Capacitated transit service network design with boundedly rational agents," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 225-250.
    17. Cruz, F.R.B. & van Woensel, T. & MacGregor Smith, J. & Lieckens, K., 2010. "On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks," European Journal of Operational Research, Elsevier, vol. 201(1), pages 183-193, February.
    18. (Walker) Wang, Wei & Wang, David Z.W. & Sun, Huijun & Feng, Zengzhe & Wu, Jianjun, 2016. "Braess Paradox of traffic networks with mixed equilibrium behaviors," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 95-114.
    19. Novak, D.C. & Sullivan, J.F. & Sentoff, K. & Dowds, J., 2020. "A framework to guide strategic disinvestment in roadway infrastructure considering social vulnerability," Transportation Research Part A: Policy and Practice, Elsevier, vol. 132(C), pages 436-451.
    20. Liu, Zhaocai & Chen, Zhibin & He, Yi & Song, Ziqi, 2021. "Network user equilibrium problems with infrastructure-enabled autonomy," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 207-241.

    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:129:y:2019:i:c:p:35-49. 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.