Details:
-
Creators:
-
Corporate Creators:
-
Corporate Contributors:
-
Subject/TRT Terms:
-
Resource Type:
-
Geographical Coverage:
-
TRIS Online Accession Number:00813762
-
Corporate Publisher:
-
Abstract:To find the shortest path in a network is often a problem in transportation applications. This paper considers a shortest path problem in which the costs are a particular nonlinear, nonseparable function. An algorithm of feasible-directions variety in which subproblems are simple minimum cost flow linear programs is presented. To ensure that a path which produces a lower function value is found, the algorithm contains a heuristic component.
-
Format:
-
Collection(s):
-
Main Document Checksum:
-
File Type:
Supporting Files
-
No Additional Files
More +