Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Vehicle Routing Problem× | Modèles de localisation-affectation× | |
|---|---|---|
| Domaine≠ | Optimisation | Analyse spatiale |
| Famille | Process / pipeline | Process / pipeline |
| Année d'origine≠ | 1959 | 1963 |
| Auteur d'origine≠ | George Dantzig & John Ramser | Leon Cooper; S. L. Hakimi |
| Type≠ | Combinatorial optimization problem | Spatial facility-location optimization |
| Source fondatrice≠ | 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 ↗ |
| Alias | 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 |
| Apparentées≠ | 3 | 4 |
| Résumé≠ | 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. |
| ScholarGateJeu de données ↗ |
|
|