Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Analytic Hierarchy Process× | Least-Cost Path / Cost-Distance Analysis× | |
|---|---|---|
| Ämnesområde≠ | Beslutsfattande | Rumslig analys |
| Familj≠ | MCDM | Process / pipeline |
| Ursprungsår≠ | 1980 | 1994 |
| Upphovsperson≠ | Saaty, T. L. | Edsger Dijkstra (shortest path); GIS cost-surface adaptation |
| Typ≠ | Pairwise comparison (eigenvalue) | Raster cost-surface routing |
| Ursprungskälla≠ | Saaty, T. L. (1980). The Analytic Hierarchy Process: Planning, Priority Setting, Resource Allocation. McGraw-Hill, New York ISBN: 978-0070543713 | Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. DOI ↗ |
| Alias≠ | — | cost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yol |
| Närliggande≠ | 8 | 3 |
| Sammanfattning≠ | AHP (Analytic Hierarchy Process) is a weight subjective multi-criteria decision-making (MCDM) method introduced by Saaty, T. L. in 1980. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result. | 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. |
| ScholarGateDatamängd ↗ |
|
|