Comparer des méthodes

	Analyse de zone de service	Analyse de chemin de moindre coût / Analyse coût-distance
Domaine	Analyse spatiale	Analyse spatiale
Famille	Process / pipeline	Process / pipeline
Année d'origine	2001	1994
Auteur d'origine	Harvey Miller & Shih-Lung Shaw	Edsger Dijkstra (shortest path); GIS cost-surface adaptation
Type	Network GIS pipeline	Raster cost-surface routing
Source fondatrice	Miller, H. J., & Shaw, S.-L. (2001). Geographic Information Systems for Transportation: Principles and Applications. Oxford University Press. ISBN: 978-0-19-512394-4	Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271.
Alias	Isochrone Analysis, Network Catchment Area Analysis, Travel-Time Polygon Analysis, Hizmet Alanı Analizi	cost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yol
Apparentées	3	3
Résumé	Service Area Analysis delineates the geographic region reachable from one or more origin facilities within a specified travel cost — typically time, distance, or generalized impedance — by traversing a real road or transit network. It is widely used by urban planners, public health officials, logistics managers, and emergency response coordinators who need to understand actual accessibility rather than simple straight-line buffers.	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.