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

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 journ...

Full description

Saved in:
Bibliographic Details
Published in:Transportation science 1972-05, Vol.6 (2), p.131-136
Main Authors: Blumenfeld, Dennis, Landau, Matthias
Format: Article
Language:English
Subjects:
Algorithms
Fixed costs
Freight costs
Minimization of cost
Rail freight
Roads
Travel expenses
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0041-1655
1526-5447
DOI:10.1287/trsc.6.2.131