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

Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem

Author

Listed:
  • Terry L. Friesz

    (University of Pennsylvania, Philadelphia, Pennsylvania)

  • Javier Luque

    (University of Puerto Rico, Rio Piedras, Puerto Rico)

  • Roger L. Tobin

    (GTE Laboratories Incorporated, Waltham, Massachusetts)

  • Byung-Wook Wie

    (University of Hawaii, Honolulu, Hawaii)

Abstract
Two continuous time formulations of the dynamic traffic assignment problem are considered, one that corresponds to system optimization and the other to a version of user optimization on a single mode network using optimal control theory. Pontryagin's necessary conditions are analyzed and given economic interpretations that correspond to intuitive notions regarding dynamic system optimized and dynamic user optimized traffic flow patterns. Notably, we offer the first dynamic generalization of Beckmann's equivalent optimization problem for static user optimized traffic assignment in the form of an optimal control problem. The analysis further establishes that a constraint qualification and convexity requirements for the Hamiltonian, which together ensure that the necessary conditions are also sufficient, are satisfied under commonly encountered regularity conditions.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:37:y:1989:i:6:p:893-901
    DOI: 10.1287/opre.37.6.893
    as

    Download full text from publisher

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

    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:oropre:v:37:y:1989:i:6:p:893-901. 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.