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

An overview of nontraditional formulations of static and dynamic equilibrium network design

Author

Listed:
  • Friesz, Terry L.
  • Shah, Samir

Abstract

This paper reviews two classes of nontraditional models for the (dis)equilibrium network design problem and uses these to describe research needed to advance the state-of-the art in the design of both static and dynamic networks. The static equilibrium design model emphasized herein recalls an important earlier result that allows the equilibrium network design problem to be stated as a single level mathematical program (SMP), a result which is surprisingly little known; it also introduces for the first time nonseparable elastic transportation demands and attendant difficulties in evaluating the consumers' surplus line integral. The dynamic, disequilibrium network design model emphasized herein maintains the usual design objective of maximizing some measure of social welfare, but recognizes that traffic on a network is not necessarily in equilibrium and that capacity changes to the network must induce transient phenomena not captured by invocation of the static version of Wardrop's first principle (user equilibrium). It is argued that such disequilibrium models by their very nature avoid temporal versions of Braess' paradox familiar from static equilibrium design and are naturally formulated as optimal control problems. Moreover, properly formulated disequilibrium design models are shown to overcome difficulties associated with evaluating the consumers' surplus line integral. Furthermore, when the associated disequilibrium dynamics are stable, these optimal control formulations are observed to be capable of computing static equilibrium network designs.

Suggested Citation

  • Friesz, Terry L. & Shah, Samir, 2001. "An overview of nontraditional formulations of static and dynamic equilibrium network design," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 5-21, January.
  • Handle: RePEc:eee:transb:v:35:y:2001:i:1:p:5-21
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(00)00002-3
    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. Terry L. Friesz & David Bernstein & Roger Stough, 1996. "Dynamic Systems, Variational Inequalities and Control Theoretic Models for Predicting Time-Varying Urban Network Flows," Transportation Science, INFORMS, vol. 30(1), pages 14-31, February.
    2. Friesz, Terry L., 1981. "An equivalent optimization problem for combined multiclass distribution, assignment and modal split which obviates symmetry restrictions," Transportation Research Part B: Methodological, Elsevier, vol. 15(5), pages 361-369, October.
    3. Jara-Díaz, Sergio R. & Friesz, Terry L., 1982. "Measuring the benefits derived from a transportation investment," Transportation Research Part B: Methodological, Elsevier, vol. 16(1), pages 57-77, February.
    4. Terry L. Friesz & Samir Shah & David Bernstein, 1998. "Disequilibrium Network Design: A New Paradigm for Transportation Planning and Control," Advances in Spatial Science, in: Lars Lundqvist & Lars-Göran Mattsson & Tschangho John Kim (ed.), Network Infrastructure and the Urban Environment, chapter 6, pages 99-111, Springer.
    5. Terry L. Friesz & Hsun-Jung Cho & Nihal J. Mehta & Roger L. Tobin & G. Anandalingam, 1992. "A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints," Transportation Science, INFORMS, vol. 26(1), pages 18-26, February.
    6. Friesz, Terry L. & Anandalingam, G. & Mehta, Nihal J. & Nam, Keesung & Shah, Samir J. & Tobin, Roger L., 1993. "The multiobjective equilibrium network design problem revisited: A simulated annealing approach," European Journal of Operational Research, Elsevier, vol. 65(1), pages 44-57, February.
    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. Cantarella, G.E. & Pavone, G. & Vitetta, A., 2006. "Heuristics for urban road network design: Lane layout and signal settings," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1682-1695, December.
    2. Giulio Cantarella & Pietro Velonà & David Watling, 2015. "Day-to-day Dynamics & Equilibrium Stability in A Two-Mode Transport System with Responsive bus Operator Strategies," Networks and Spatial Economics, Springer, vol. 15(3), pages 485-506, September.
    3. Ukkusuri, Satish V. & Patil, Gopal, 2009. "Multi-period transportation network design under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 625-642, July.
    4. Wei Nai & Zan Yang & Dan Li & Lu Liu & Yuting Fu & Yuao Guo, 2024. "Urban Day-to-Day Travel and Its Development in an Information Environment: A Review," Sustainability, MDPI, vol. 16(6), pages 1-29, March.
    5. Giulio Cantarella & Antonino Vitetta, 2006. "The multi-criteria road network design problem in an urban area," Transportation, Springer, vol. 33(6), pages 567-588, November.

    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. Yu Nie & H. Zhang, 2010. "A Relaxation Approach for Estimating Origin–Destination Trip Tables," Networks and Spatial Economics, Springer, vol. 10(1), pages 147-172, March.
    2. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    3. Yang, Hai & Bell, Michael G. H., 2001. "Transport bilevel programming problems: recent methodological advances," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 1-4, January.
    4. Wang, Yu & Liu, Haoxiang & Fan, Yinchao & Ding, Jianxun & Long, Jiancheng, 2022. "Large-scale multimodal transportation network models and algorithms-Part II: Network capacity and network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    5. Marin, Angel & Salmeron, Javier, 1996. "Tactical design of rail freight networks. Part I: Exact and heuristic methods," European Journal of Operational Research, Elsevier, vol. 90(1), pages 26-44, April.
    6. Byung Kim & Wonkyu Kim & Byung Song, 2008. "Sequencing and scheduling highway network expansion using a discrete network design model," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 42(3), pages 621-642, September.
    7. Enrique Fernández L., J. & de Cea Ch., Joaquin & Malbran, R. Henry, 2008. "Demand responsive urban public transport system design: Methodology and application," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(7), pages 951-972, August.
    8. Ukkusuri, Satish V. & Patil, Gopal, 2009. "Multi-period transportation network design under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 625-642, July.
    9. 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.
    10. Bilel JARRAYA, 2013. "Asset Allocation And Portfolio Optimization Problems With Metaheuristics: A Literature Survey," Business Excellence and Management, Faculty of Management, Academy of Economic Studies, Bucharest, Romania, vol. 3(4), pages 38-56, December.
    11. Joseph Y. J. Chow & Amelia C. Regan, 2011. "Real Option Pricing of Network Design Investments," Transportation Science, INFORMS, vol. 45(1), pages 50-63, February.
    12. Friesz, Terry L. & Suo, Zhong-Gui & Bernstein, David H., 1998. "A dynamic disequilibrium interregional commodity flow model," Transportation Research Part B: Methodological, Elsevier, vol. 32(7), pages 467-483, September.
    13. A. Stathopoulos & T. Tsekeris, 2003. "Framework for analysing reliability and information degradation of demand matrices in extended transport networks," Transport Reviews, Taylor & Francis Journals, vol. 23(1), pages 89-103, January.
    14. Bellei, Giuseppe & Gentile, Guido & Papola, Natale, 2005. "A within-day dynamic traffic assignment model for urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 39(1), pages 1-29, January.
    15. Poorzahedy, Hossain & Rouhani, Omid M., 2007. "Hybrid meta-heuristic algorithms for solving network design problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 578-596, October.
    16. Birbil, S.I. & Fang, S-C. & Han, J., 2002. "Entropic Regularization Approach for Mathematical Programs with Equilibrium Constraints," ERIM Report Series Research in Management ERS-2002-71-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    17. Lam, William H.K. & Li, Zhi-Chun & Huang, Hai-Jun & Wong, S.C., 2006. "Modeling time-dependent travel choice problems in road networks with multiple user classes and multiple parking facilities," Transportation Research Part B: Methodological, Elsevier, vol. 40(5), pages 368-395, June.
    18. Li, Changmin & Yang, Hai & Zhu, Daoli & Meng, Qiang, 2012. "A global optimization method for continuous network design problems," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1144-1158.
    19. Y. S. Xia & J. Wang, 2000. "On the Stability of Globally Projected Dynamical Systems," Journal of Optimization Theory and Applications, Springer, vol. 106(1), pages 129-150, July.
    20. Xu, Meng & Chen, Anthony & Gao, Ziyou, 2008. "An improved origin-based algorithm for solving the combined distribution and assignment problem," European Journal of Operational Research, Elsevier, vol. 188(2), pages 354-369, July.

    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:transb:v:35:y:2001:i:1:p:5-21. 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.