IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v4y1970i1p36-51.html
   My bibliography  Save this article

The Method of Competing Links

Author

Listed:
  • Alan K. Halder

    (The Johns Hopkins University, Baltimore, Maryland)

Abstract

A problem that is of interest in transportation planning, as well as other fields, is the effect on some or all of the shortest routes through a network, of increasing the length of a link in the network, or removing a link completely. A method is described for handling this problem, by establishing a subset of links, one of which must be contained in any alternative shortest path. These are referred to as the competing links. It is shown that this method has applications going beyond the particular problem cited. It may be applied to measuring the effects of altering some of the links in a network subjected to congested flow. The results presented for the algorithm compare very favorably with alternative procedures. It is suggested that the algorithm could be used in the development of networks which are, in some sense, optimal.

Suggested Citation

  • Alan K. Halder, 1970. "The Method of Competing Links," Transportation Science, INFORMS, vol. 4(1), pages 36-51, February.
    • Handle: RePEc:inm:ortrsc:v:4:y:1970:i:1:p:36-51
    DOI: 10.1287/trsc.4.1.36
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.4.1.36
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.4.1.36?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:4:y:1970:i:1:p:36-51. 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.