Vertaile menetelmiä
Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.
| Ajoneuvoreititysongelma (VRP)× | Sijainti-allokointimallit× | Palvelualueanalyysi× | |
|---|---|---|---|
| Tieteenala≠ | Optimointi | Spatiaalianalyysi | Spatiaalianalyysi |
| Menetelmäperhe | Process / pipeline | Process / pipeline | Process / pipeline |
| Syntyvuosi≠ | 1959 | 1963 | 2001 |
| Kehittäjä≠ | George Dantzig & John Ramser | Leon Cooper; S. L. Hakimi | Harvey Miller & Shih-Lung Shaw |
| Tyyppi≠ | Combinatorial optimization problem | Spatial facility-location optimization | Network GIS pipeline |
| Alkuperäislähde≠ | Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80–91. DOI ↗ | Cooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343. DOI ↗ | Miller, H. J., & Shaw, S.-L. (2001). Geographic Information Systems for Transportation: Principles and Applications. Oxford University Press. ISBN: 978-0-19-512394-4 |
| Rinnakkaisnimet | Capacitated Vehicle Routing Problem, Fleet Routing Problem, Multi-Vehicle Routing Problem, Araç Rotalama Problemi | facility location, p-median problem, maximal covering location problem, yer-tahsis modelleri | Isochrone Analysis, Network Catchment Area Analysis, Travel-Time Polygon Analysis, Hizmet Alanı Analizi |
| Liittyvät≠ | 3 | 4 | 3 |
| Tiivistelmä≠ | 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. | 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. | 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. |
| ScholarGateAineisto ↗ |
|
|
|