방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 최소 비용 경로 / 비용 거리 분석× | 로케이션-할당 모델× | |
|---|---|---|
| 분야 | 공간분석 | 공간분석 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1994 | 1963 |
| 창시자≠ | Edsger Dijkstra (shortest path); GIS cost-surface adaptation | Leon Cooper; S. L. Hakimi |
| 유형≠ | Raster cost-surface routing | Spatial facility-location optimization |
| 원전≠ | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. DOI ↗ | Cooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343. DOI ↗ |
| 별칭 | cost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yol | facility location, p-median problem, maximal covering location problem, yer-tahsis modelleri |
| 관련≠ | 3 | 4 |
| 요약≠ | 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. | 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. |
| ScholarGate데이터셋 ↗ |
|
|