A Transport Improvement Problem Transformable to a Best-Path Problem

A. J. Goldman and G. L. Nemhauser
Additional contact information
A. J. Goldman: National Bureau of Standards, Washington, D.C.
G. L. Nemhauser: Johns Hopkins University, Baltimore, Maryland

Transportation Science, 1967, vol. 1, issue 4, 295-307

Abstract: For each arc ( i , j ) of a transport network, suppose given an initial traversal disutility d ( i , j ) and a function f ( i , j , r ) describing the reduced disutility that would result from applying r units of resources to “improve” the arc. For each origin-destination pair, there arises the problem of how a limited resource budget should be allocated among the arcs so as to optimize a best path from origin to destination in the improved network. It is shown here that this problem is transformable to a best-path problem in an enlarged network. The allowable investment levels in individual arcs can be constrained as desired.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1.4.295 (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:1:y:1967:i:4:p:295-307

Access Statistics for this article

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