Salīdzināt metodes

	Location-Allocation	Analīze mazākajām izmaksām / izmaksu attāluma analīze
Nozare	Telpiskā analīze	Telpiskā analīze
Saime	Process / pipeline	Process / pipeline
Izcelsmes gads	1963	1994
Autors	Leon Cooper; S. L. Hakimi	Edsger Dijkstra (shortest path); GIS cost-surface adaptation
Tips	Spatial facility-location optimization	Raster cost-surface routing
Pirmavots	Cooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343.	Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271.
Citi nosaukumi	facility location, p-median problem, maximal covering location problem, yer-tahsis modelleri	cost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yol
Saistītās	4	3
Kopsavilkums	Location-allocation models decide where to place a set of facilities and simultaneously assign demand points to them so as to optimize an objective such as total travel cost, worst-case distance, or population covered. Rooted in the operations-research work of Cooper (1963) and Hakimi (1964) and central to network GIS, they answer questions like where to site warehouses, hospitals, fire stations, or schools to best serve a spatially distributed population.	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.