Võrdle meetodeid
Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.
| Asukohavaliku mudelid× | Vähimalkulude tee / kuludistantsi analüüs× | |
|---|---|---|
| Valdkond | Ruumianalüüs | Ruumianalüüs |
| Perekond | Process / pipeline | Process / pipeline |
| Tekkeaasta≠ | 1963 | 1994 |
| Looja≠ | Leon Cooper; S. L. Hakimi | Edsger Dijkstra (shortest path); GIS cost-surface adaptation |
| Tüüp≠ | Spatial facility-location optimization | Raster cost-surface routing |
| Algallikas≠ | 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 ↗ |
| Rööpnimetused | 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 |
| Seotud≠ | 4 | 3 |
| Kokkuvõte≠ | 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. |
| ScholarGateAndmestik ↗ |
|
|