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

Geographic Decomposition of the Shortest Path Problem, with an Application to the Traffic Assignment Problem

Author

Listed:
  • Zachary F. Lansdowne

    (Control Analysis Corporation, Palo Alto, California)

  • David W. Robinson

    (University Analytics, Inc., Durham, North Carolina)

Abstract

An algorithm, which can be applied to loosely connected networks, is given for geographically decomposing the shortest path problem. The algorithm is applicable to the traffic assignment problem when it is solved as a series of shortest path problems by the Frank-Wolfe algorithm. Numerical results for a large 1287 node, 3752 arc traffic assignment problem for Washington, D.C., indicate that using geographical decomposition can reduce computer memory storage requirements or program run time.

Suggested Citation

  • Zachary F. Lansdowne & David W. Robinson, 1982. "Geographic Decomposition of the Shortest Path Problem, with an Application to the Traffic Assignment Problem," Management Science, INFORMS, vol. 28(12), pages 1380-1390, December.
    • Handle: RePEc:inm:ormnsc:v:28:y:1982:i:12:p:1380-1390
    DOI: 10.1287/mnsc.28.12.1380
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.28.12.1380
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.28.12.1380?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:ormnsc:v:28:y:1982:i:12:p:1380-1390. 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.