IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v32y1998i7p539-545.html
   My bibliography  Save this article

A capacity paradox in network design and how to avoid it

Author

Listed:
  • Yang, Hai
  • Bell, Michael G. H.

Abstract

The network design problem is often alluded to in the transportation literature together with the spectacular example of Braess paradox, which tells us that creating a new link in a congested network or adding capacity to an existing link may actually increase network-wide congestion or user travel costs. In this note we introduce a new paradox pertaining to network design problems. Using a simple network example, we demonstrate that the addition of a new road segment to a road network may actually reduce the potential capacity of the network. We then show how this capacity paradox can be avoided by introducing the concept of network reserve capacity into network design problems.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transa:v:32:y:1998:i:7:p:539-545
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965-8564(98)00017-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Penchina, Claude M., 1997. "Braess paradox: Maximum penalty in a minimal critical network," Transportation Research Part A: Policy and Practice, Elsevier, vol. 31(5), pages 379-388, September.
    2. Carlos F. Daganzo, 1998. "Queue Spillovers in Transportation Networks with a Route Choice," Transportation Science, INFORMS, vol. 32(1), pages 3-11, February.
    3. 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.
    4. Wong, S. C. & Yang, Hai, 1997. "Reserve capacity of a signal-controlled road network," Transportation Research Part B: Methodological, Elsevier, vol. 31(5), pages 397-402, October.
    5. Yang, Hai, 1997. "Sensitivity analysis for the elastic-demand network equilibrium problem with applications," Transportation Research Part B: Methodological, Elsevier, vol. 31(1), pages 55-70, February.
    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. 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).
    2. 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).
    3. Yang, Chao & Chen, Anthony, 2009. "Sensitivity analysis of the combined travel demand model with applications," European Journal of Operational Research, Elsevier, vol. 198(3), pages 909-921, November.
    4. Ziyou, Gao & Yifan, Song, 2002. "A reserve capacity model of optimal signal control with user-equilibrium route choice," Transportation Research Part B: Methodological, Elsevier, vol. 36(4), pages 313-323, May.
    5. 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.
    6. Yang, Hai & Bell, Michael G. H. & Meng, Qiang, 2000. "Modeling the capacity and level of service of urban transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(4), pages 255-275, May.
    7. Morgan, John & Orzen, Henrik & Sefton, Martin, 2009. "Network architecture and traffic flows: Experiments on the Pigou-Knight-Downs and Braess Paradoxes," Games and Economic Behavior, Elsevier, vol. 66(1), pages 348-372, May.
    8. Gao, Ziyou & Sun, Huijun & Shan, Lian Long, 2004. "A continuous equilibrium network design model and algorithm for transit systems," Transportation Research Part B: Methodological, Elsevier, vol. 38(3), pages 235-250, March.
    9. Takashi Akamatsu & Benjamin Heydecker, 2003. "Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks," Transportation Science, INFORMS, vol. 37(2), pages 123-138, May.
    10. Chen, Anthony & Yang, Hai & Lo, Hong K. & Tang, Wilson H., 2002. "Capacity reliability of a road network: an assessment methodology and numerical results," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 225-252, March.
    11. Wei-Hua Lin & Hong K. Lo, 2009. "Investigating Braess' Paradox with Time-Dependent Queues," Transportation Science, INFORMS, vol. 43(1), pages 117-126, February.
    12. Jian Wang & Muqing Du & Lili Lu & Xiaozheng He, 2018. "Maximizing Network Throughput under Stochastic User Equilibrium with Elastic Demand," Networks and Spatial Economics, Springer, vol. 18(1), pages 115-143, March.
    13. Meng, Q. & Yang, H. & Bell, M. G. H., 2001. "An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 83-105, January.
    14. Rapoport, Amnon & Mak, Vincent & Zwick, Rami, 2006. "Navigating congested networks with variable demand: Experimental evidence," Journal of Economic Psychology, Elsevier, vol. 27(5), pages 648-666, October.
    15. Josefsson, Magnus & Patriksson, Michael, 2007. "Sensitivity analysis of separable traffic equilibrium equilibria with application to bilevel optimization in network design," Transportation Research Part B: Methodological, Elsevier, vol. 41(1), pages 4-31, January.
    16. Sohn, Keemin, 2011. "Multi-objective optimization of a road diet network design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(6), pages 499-511, July.
    17. Luigi dell’Olio & Angel Ibeas & Francisco Ruisánchez, 2012. "Optimizing bus-size and headway in transit networks," Transportation, Springer, vol. 39(2), pages 449-464, March.
    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. Anna Nagurney & Qiang Qiang, 2008. "An efficiency measure for dynamic networks modeled as evolutionary variational inequalities with application to the Internet and vulnerability analysis," Netnomics, Springer, vol. 9(1), pages 1-20, January.
    20. 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.

    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:eee:transa:v:32:y:1998:i:7:p:539-545. 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/547/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.