Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Modele de localizare-alocare× | Analiza Căii cu Cost Minim (Least-Cost Path) / Analiza Cost-Distanță× | |
|---|---|---|
| Domeniu | Analiză spațială | Analiză spațială |
| Familie | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1963 | 1994 |
| Autorul original≠ | Leon Cooper; S. L. Hakimi | Edsger Dijkstra (shortest path); GIS cost-surface adaptation |
| Tip≠ | Spatial facility-location optimization | Raster cost-surface routing |
| Sursa seminală≠ | Cooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343. DOI ↗ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. DOI ↗ |
| Denumiri alternative | 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 |
| Înrudite≠ | 4 | 3 |
| Rezumat≠ | 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. |
| ScholarGateSet de date ↗ |
|
|