[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v21y1987i4p254-263.html
   My bibliography  Save this article

Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem

Author

Listed:
  • Chaisak Suwansirikul

    (University of Pennsylvania, Philadelphia, Pennsylvania)

  • Terry L. Friesz

    (University of Pennsylvania, Philadelphia, Pennsylvania)

  • Roger L. Tobin

    (GTE Laboratories, Inc., Waltham, Massachusetts)

Abstract
For applications of realistic size, both the discrete and continuous versions of the equilibrium network design problem are too computationally intensive to be solved exactly with the algorithms proposed to date. This intractibility owes to Braess' paradox which makes it necessary to constrain the flow pattern to be a noncooperative Nash or user equilibrium. This paper suggests a new heuristic for finding an approximate solution to the continuous equilibrium network design problem. Numerical tests are reported which indicate that, for networks with significant congestion, the heuristic is markedly more efficient than the Hooke-Jeeves algorithm which has been employed previously. The efficiency of the heuristic results from decomposition of the original problem into a set of interacting optimization subproblems. This decomposition is such that, at each iteration of the algorithm, only one user equilibrium needs to be calculated in order to update the improvement variables of all arcs of the network. This contrasts sharply with the Hooke-Jeeves algorithm which can require that a new user equilibrium be calculated each time an individual arc improvement variable is updated.

Suggested Citation

  • Chaisak Suwansirikul & Terry L. Friesz & Roger L. Tobin, 1987. "Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem," Transportation Science, INFORMS, vol. 21(4), pages 254-263, November.
    • Handle: RePEc:inm:ortrsc:v:21:y:1987:i:4:p:254-263
    DOI: 10.1287/trsc.21.4.254
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.21.4.254
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.21.4.254?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
    ---><---

    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:inm:ortrsc:v:21:y:1987:i:4:p:254-263. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.