Comparer des méthodes

	Analyse de chemin de moindre coût / Analyse coût-distance	Modèles de localisation-affectation	Vehicle Routing Problem
Domaine	Analyse spatiale	Analyse spatiale	Optimisation
Famille	Process / pipeline	Process / pipeline	Process / pipeline
Année d'origine	1994	1963	1959
Auteur d'origine	Edsger Dijkstra (shortest path); GIS cost-surface adaptation	Leon Cooper; S. L. Hakimi	George Dantzig & John Ramser
Type	Raster cost-surface routing	Spatial facility-location optimization	Combinatorial optimization problem
Source fondatrice	Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271.	Cooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343.	Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80–91.
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	Capacitated Vehicle Routing Problem, Fleet Routing Problem, Multi-Vehicle Routing Problem, Araç Rotalama Problemi
Apparentées	3	4	3
Résumé	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.	The Vehicle Routing Problem (VRP) seeks the minimum-cost set of routes for a fleet of vehicles to serve a collection of geographically dispersed customers, each with a known demand, departing from and returning to a central depot. Originally formulated as the Truck Dispatching Problem by Dantzig and Ramser in 1959, VRP is a foundational model in logistics, supply chain management, and operations research, applicable whenever goods or services must be delivered efficiently across multiple stops.