Módszerek összehasonlítása

	Legkisebb költségű út / Költség-távolság elemzés	Járműútvonal-tervezési Probléma (VRP)
Tudományterület	Térbeli elemzés	Optimalizálás
Módszercsalád	Process / pipeline	Process / pipeline
Keletkezés éve	1994	1959
Megalkotó	Edsger Dijkstra (shortest path); GIS cost-surface adaptation	George Dantzig & John Ramser
Típus	Raster cost-surface routing	Combinatorial optimization problem
Alapmű	Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271.	Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80–91.
Alternatív nevek	cost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yol	Capacitated Vehicle Routing Problem, Fleet Routing Problem, Multi-Vehicle Routing Problem, Araç Rotalama Problemi
Kapcsolódó	3	3
Összefoglaló	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.	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.