The Method of Competing Links

Alan K. Halder
Additional contact information
Alan K. Halder: The Johns Hopkins University, Baltimore, Maryland

Transportation Science, 1970, vol. 4, issue 1, 36-51

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.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.4.1.36 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:4:y:1970:i:1:p:36-51

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().