IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v22y1975i1p87-95.html
   My bibliography  Save this article

A Primal-Dual Traffic Assignment Algorithm

Author

Listed:
  • E. R. Petersen

    (Queen's University, Ontario)

Abstract

A new algorithm for solving the traffic assignment problem is presented. This is a primal-dual algorithm which utilizes a flow augmentation primal and a shortest path dual procedure. At each iteration a feasible solution is known together with a measure of "goodness" of the solution. It is shown that the algorithm converges to an optimal solution. Experience with the algorithm suggests that this convergence is very rapid.

Suggested Citation

  • E. R. Petersen, 1975. "A Primal-Dual Traffic Assignment Algorithm," Management Science, INFORMS, vol. 22(1), pages 87-95, September.
    • Handle: RePEc:inm:ormnsc:v:22:y:1975:i:1:p:87-95
    DOI: 10.1287/mnsc.22.1.87
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zheng, Hong & Peeta, Srinivas, 2014. "Cost scaling based successive approximation algorithm for the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 17-30.
    2. David L. Alderson & Gerald G. Brown & W. Matthew Carlyle & R. Kevin Wood, 2018. "Assessing and Improving the Operational Resilience of a Large Highway Infrastructure System to Worst-Case Losses," Transportation Science, INFORMS, vol. 52(4), pages 1012-1034, August.
    3. Hong Zheng, 2015. "Adaptation of Network Simplex for the Traffic Assignment Problem," Transportation Science, INFORMS, vol. 49(3), pages 543-558, August.
    4. Igor Konnov, 2017. "An Adaptive Partial Linearization Method for Optimization Problems on Product Sets," Journal of Optimization Theory and Applications, Springer, vol. 175(2), pages 478-501, November.

    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:ormnsc:v:22:y:1975:i:1:p:87-95. 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.