Minimum-Cost Paths for a System Composed of Ordinary Routes and a Special Network of Cheap Routes

Dennis Blumenfeld and Matthias Landau
Additional contact information
Dennis Blumenfeld: Research Group in Traffic Studies, University College, London, England
Matthias Landau: Research Group in Traffic Studies, University College, London, England

Transportation Science, 1972, vol. 6, issue 2, 131-136

Abstract: An algorithm is presented for determining the minimum-cost paths through a system consisting of ordinary routes and a restricted network of cheap routes. The number of computations required using the algorithm is in general considerably less than for a comparison of all possible paths for each journey.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.6.2.131 (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:6:y:1972:i:2:p:131-136

Access Statistics for this article

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