Methoden vergleichen

	Analyse von Einzugsgebieten	Standortzuweisungsmodelle	Das Vehicle Routing Problem (VRP)
Fachgebiet	Räumliche Analyse	Räumliche Analyse	Optimierung
Familie	Process / pipeline	Process / pipeline	Process / pipeline
Entstehungsjahr	2001	1963	1959
Urheber	Harvey Miller & Shih-Lung Shaw	Leon Cooper; S. L. Hakimi	George Dantzig & John Ramser
Typ	Network GIS pipeline	Spatial facility-location optimization	Combinatorial optimization problem
Wegweisende Quelle	Miller, H. J., & Shaw, S.-L. (2001). Geographic Information Systems for Transportation: Principles and Applications. Oxford University Press. ISBN: 978-0-19-512394-4	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.
Aliasnamen	Isochrone Analysis, Network Catchment Area Analysis, Travel-Time Polygon Analysis, Hizmet Alanı Analizi	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
Verwandt	3	4	3
Zusammenfassung	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.	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.