Metraipolis › archive › dc_aef26cea1d84
Vehicle routing problem — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Vehicle_routing_problem
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-31T08:34:45.070Z
- SHA-256 of the archived text
25a4305d1d97a21eeb00a7003704f79568a6792f75cfc4c7c49e9818ae27f290- Stable URL of this page
https://metraipolis.com/documento/dc_aef26cea1d84
How to cite
Vehicle routing problem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Vehicle_routing_problem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_aef26cea1d84 (Metraipolis archive dc_aef26cea1d84, sha256 25a4305d1d97a21eeb00a7003704f79568a6792f75cfc4c7c49e9818ae27f290)
BibTeX
@misc{dcaef26cea1d84,
title = {Vehicle routing problem — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Vehicle_routing_problem},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_aef26cea1d84; sha256 25a4305d1d97a21eeb00a7003704f79568a6792f75cfc4c7c49e9818ae27f290},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Vehicle_routing_problem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?" The problem first appeared, as the truck dispatching problem, in a paper by George Dantzig and John Ramser in 1959, in which it was applied to petrol deliveries. Often, the context is that of delivering goods located at a central depot to customers who have placed orders for such goods. However, variants of the problem consider, e.g., collection of solid waste and the transport of the elderly and the sick to and from health-care facilities. The standard objective of the VRP is to minimise the total route cost. Other objectives, such as minimising the number of vehicles used or travelled distance are also considered. The VRP generalises the travelling salesman problem (TSP), which is equivalent to requiring a single route to visit all locations. As the TSP is NP-hard, the VRP is also NP-hard. VRP has many direct applications in industry. Vendors of VRP routing tools often claim that they can offer cost savings of 5%–30%. Commercial solvers tend to use heuristics due to the size and frequency of real world VRPs they need to solve. Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; ricerca «reinforcement learning»). Fonte: Wikipedia in inglese, voce «Vehicle routing problem» — https://en.wikipedia.org/wiki/Vehicle_routing_problem Wikidata Q944041: «combinatorial optimization problem about the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q944041 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Vehicle_routing_problem?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1381604383, consultata il 2026-10-31T08:24:29.066Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4a293e8180250f27c930b4850e079f58c9284b9b378ba9fd236ec31da0338d04