방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 차량 경로 문제 (VRP)× | 로케이션-할당 모델× | |
|---|---|---|
| 분야≠ | 최적화 | 공간분석 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1959 | 1963 |
| 창시자≠ | George Dantzig & John Ramser | Leon Cooper; S. L. Hakimi |
| 유형≠ | Combinatorial optimization problem | Spatial facility-location optimization |
| 원전≠ | 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 ↗ |
| 별칭 | 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 |
| 관련≠ | 3 | 4 |
| 요약≠ | 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. |
| ScholarGate데이터셋 ↗ |
|
|