So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Mô hình Phân bổ-Địa điểm× | Bài toán Định tuyến Phương tiện (VRP)× | |
|---|---|---|
| Lĩnh vực≠ | Phân tích không gian | Tối ưu hóa |
| Họ | Process / pipeline | Process / pipeline |
| Năm ra đời≠ | 1963 | 1959 |
| Người khởi xướng≠ | Leon Cooper; S. L. Hakimi | George Dantzig & John Ramser |
| Loại≠ | Spatial facility-location optimization | Combinatorial optimization problem |
| Công trình gốc≠ | Cooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343. DOI ↗ | Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80–91. DOI ↗ |
| Tên gọi khác | 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 |
| Liên quan≠ | 4 | 3 |
| Tóm tắt≠ | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|