least-cost path
See Also: cost, shortest path
[network analysis] The path between two locations that costs the least to traverse, where cost is a function of time, distance, or some other criteria defined by the user.
least-cost path
The path between two locations that costs the least to traverse, where cost is a function of time, distance, or some other criteria defined by the user.
least-squares adjustment ...
least-cost path The path, among possibly many, between two points which has the lowest traversal cost, where cost is a function of time, distance, or other user-defined factors. See also impedance.
This map shows the least-cost path between a stand of forest and the nearest sawmill. Factors such as slope, road infrastructure, and land use were combined with travel cost to find the optimal route.
drain, in order to trace the least-cost path given by this model between any given cell and the r.cost starting location(s). The two programs, when used together, generate least-cost paths or corridors between any two map locations (cells).
The model script does this in several steps: first the cost surface is corrected for map resolution, then 'drained' using a raster-based program to find the least-cost path.
 See also: Surface, Analysis, Location, Model, Map
|
