Process / pipelineNetwork/raster GIS
Least-Cost Path / Cost-Distance Analysis
Least-cost path analysis finds the route between two locations that minimizes accumulated travel cost across a landscape, rather than minimizing straight-line distance. By encoding terrain, slope, land cover, and other frictions into a cost surface and accumulating cost outward from a source, it identifies optimal corridors for roads, pipelines, trails, power lines, and wildlife movement — a core raster-GIS technique built on Dijkstra's shortest-path logic.
Open in MethodMindSoonVideoSoon
Read the full method
Members only
Sign inSign in with a free account to read this section.
Sources
- Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. DOI: 10.1007/BF01386390 ↗
- Douglas, D. H. (1994). Least-cost path in GIS using an accumulated cost surface and slopelines. Cartographica, 31(3), 37–51. DOI: 10.3138/D327-0323-2JUT-016M ↗