Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Proses Hierarki Analitik× | Laluan Kos Terendah / Analisis Kos-Jarak× | Model Lokasi-Peruntukan× | |
|---|---|---|---|
| Bidang≠ | Pembuatan Keputusan | Analisis Reruang | Analisis Reruang |
| Keluarga≠ | MCDM | Process / pipeline | Process / pipeline |
| Tahun asal≠ | 1980 | 1994 | 1963 |
| Pengasas≠ | Saaty, T. L. | Edsger Dijkstra (shortest path); GIS cost-surface adaptation | Leon Cooper; S. L. Hakimi |
| Jenis≠ | Pairwise comparison (eigenvalue) | Raster cost-surface routing | Spatial facility-location optimization |
| Sumber perintis≠ | 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 ↗ | Cooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343. DOI ↗ |
| Alias≠ | — | 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 |
| Berkaitan≠ | 8 | 3 | 4 |
| Ringkasan≠ | 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. | 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. |
| ScholarGateSet data ↗ |
|
|
|