IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v61y2014icp135-141.html
   My bibliography  Save this article

Braess paradox and robustness of traffic networks under stochastic user equilibrium

Author

Listed:
  • Zhao, Chunxue
  • Fu, Baibai
  • Wang, Tianming

Abstract

The Braess paradox is an important phenomenon in the traffic network, and the robustness is a characteristic that measures the network system performance under interference. Study of traffic network paradox and its robustness is an important topic of traffic assignment. In this paper, we investigate the traffic network under elastic demand, its robustness and paradox under stochastic user equilibrium. Using the Logit model and Braess’ network, we find that paradox occurs when the congestion of a newly added road meets certain criterion. Paradox severity and the ranking of the network components are both affected by the new congestion. This finding can be applied in the planning of urban traffic network.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transe:v:61:y:2014:i:c:p:135-141
    DOI: 10.1016/j.tre.2013.11.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554513001920
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2013.11.008?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. Mendes, G.A. & da Silva, L.R. & Herrmann, H.J., 2012. "Traffic gridlock on complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 362-370.
    2. Bin Ran & David E. Boyce & Larry J. LeBlanc, 1993. "A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models," Operations Research, INFORMS, vol. 41(1), pages 192-202, February.
    3. John R. Birge & James K. Ho, 1993. "Optimal Flows in Stochastic Dynamic Networks with Congestion," Operations Research, INFORMS, vol. 41(1), pages 203-216, February.
    4. Dietrich Braess & Anna Nagurney & Tina Wakolbinger, 2005. "On a Paradox of Traffic Planning," Transportation Science, INFORMS, vol. 39(4), pages 446-450, November.
    5. Terry L. Friesz & Javier Luque & Roger L. Tobin & Byung-Wook Wie, 1989. "Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem," Operations Research, INFORMS, vol. 37(6), pages 893-901, December.
    6. Chen, Huey-Kuo & Hsueh, Che-Fu, 1998. "A model and an algorithm for the dynamic user-optimal route choice problem," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 219-234, April.
    7. Dafermos, Stella & Nagurney, Anna, 1984. "On some traffic equilibrium theory paradoxes," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 101-110, April.
    8. Wie, Byung-Wook & Friesz, Terry L. & Tobin, Roger L., 1990. "Dynamic user optimal traffic assignment on congested multidestination networks," Transportation Research Part B: Methodological, Elsevier, vol. 24(6), pages 431-442, December.
    9. Fisk, Caroline, 1979. "More paradoxes in the equilibrium assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 305-309, December.
    10. Janson, Bruce N., 1991. "Dynamic traffic assignment for urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 25(2-3), pages 143-161.
    11. Anna Nagurney & David Parkes & Patrizia Daniele, 2007. "The Internet, evolutionary variational inequalities, and the time-dependent Braess paradox," Computational Management Science, Springer, vol. 4(4), pages 355-375, October.
    12. 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.
    13. Malachy Carey, 1986. "A Constraint Qualification for a Dynamic Traffic Assignment Model," Transportation Science, INFORMS, vol. 20(1), pages 55-58, February.
    14. Takashi Akamatsu & Benjamin Heydecker, 2003. "Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks," Transportation Science, INFORMS, vol. 37(2), pages 123-138, May.
    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. Wandelt, Sebastian & Sun, Xiaoqian, 2015. "Evolution of the international air transportation country network from 2002 to 2013," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 55-78.
    2. (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.
    3. 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).
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Zhang, Jiayuan & Yalcin, Mehmet G. & Hales, Douglas N., 2021. "Elements of paradoxes in supply chain management literature: A systematic literature review," International Journal of Production Economics, Elsevier, vol. 232(C).
    9. Yaoming Zhou & Jiuh‐Biing Sheu & Junwei Wang, 2017. "Robustness Assessment of Urban Road Network with Consideration of Multiple Hazard Events," Risk Analysis, John Wiley & Sons, vol. 37(8), pages 1477-1494, August.
    10. 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.
    11. Yao, Jia & Cheng, Ziyi & Chen, Anthony, 2023. "Bibliometric analysis and systematic literature review of the traffic paradoxes (1968–2022)," Transportation Research Part B: Methodological, Elsevier, vol. 177(C).
    12. 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).
    13. 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.
    14. Sun, Xiaoqian & Wandelt, Sebastian, 2014. "Network similarity analysis of air navigation route systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 416-434.

    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. Lam, William H. K. & Huang, Hai-Jun, 1995. "Dynamic user optimal traffic assignment model for many to one travel demand," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 243-259, August.
    2. Yao, Jia & Cheng, Ziyi & Chen, Anthony, 2023. "Bibliometric analysis and systematic literature review of the traffic paradoxes (1968–2022)," Transportation Research Part B: Methodological, Elsevier, vol. 177(C).
    3. 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.
    4. Xinhua Mao & Jianwei Wang & Changwei Yuan & Wei Yu & Jiahua Gan, 2018. "A Dynamic Traffic Assignment Model for the Sustainability of Pavement Performance," Sustainability, MDPI, vol. 11(1), pages 1-19, December.
    5. Tong, C. O. & Wong, S. C., 2000. "A predictive dynamic traffic assignment model in congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 625-644, November.
    6. Sheu, Jiuh-Biing, 2006. "A composite traffic flow modeling approach for incident-responsive network traffic assignment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 367(C), pages 461-478.
    7. Lam, William H. K. & Yin, Yafeng, 2001. "An activity-based time-dependent traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 35(6), pages 549-574, July.
    8. 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.
    9. Huang, Hai-Jun & Lam, William H. K., 2002. "Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 253-273, March.
    10. 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.
    11. 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.
    12. 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.
    13. Moore, II, James E. & Kim, Geunyoung & Cho, Seongdil & Hu, Hsi-hwa & Xu, Rong, 1997. "Evaluating System ATMIS Technologies Via Rapid Estimation Of Network Flows: Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5c70f3d9, Institute of Transportation Studies, UC Berkeley.
    14. Wei-Hua Lin & Hong K. Lo, 2009. "Investigating Braess' Paradox with Time-Dependent Queues," Transportation Science, INFORMS, vol. 43(1), pages 117-126, February.
    15. Chen, Huey-Kuo & Hsueh, Che-Fu, 1998. "A model and an algorithm for the dynamic user-optimal route choice problem," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 219-234, April.
    16. Ran, Bin & Boyce, David E., 1995. "Ideal Dynamic User-Optimal Route Choice: A Link-Based Variational Inequality Formulation," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt3t4686x6, Institute of Transportation Studies, UC Berkeley.
    17. Jiancheng Long & Hai-Jun Huang & Ziyou Gao & W. Y. Szeto, 2013. "An Intersection-Movement-Based Dynamic User Optimal Route Choice Problem," Operations Research, INFORMS, vol. 61(5), pages 1134-1147, October.
    18. 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).
    19. 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.
    20. Rapoport, Amnon & Kugler, Tamar & Dugar, Subhasish & Gisches, Eyran J., 2009. "Choice of routes in congested traffic networks: Experimental tests of the Braess Paradox," Games and Economic Behavior, Elsevier, vol. 65(2), pages 538-571, March.

    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:transe:v:61:y:2014:i:c:p:135-141. 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/600244/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.