Statements (51)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
Delivery services
Transportation Supply chain management |
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:field |
Computer science
Operations research |
| gptkbp:firstDescribed |
1959
|
| gptkbp:form |
gptkb:Graph_theory
gptkb:Integer_programming Linear programming |
| gptkbp:formedBy |
gptkb:George_Dantzig
|
| gptkbp:hasVariant |
Capacitated vehicle routing problem
Multiple depot vehicle routing problem Open vehicle routing problem Periodic vehicle routing problem Pickup and delivery problem Vehicle routing problem with time windows |
| https://www.w3.org/2000/01/rdf-schema#label |
Vehicle routing problem
|
| gptkbp:includedIn |
gptkb:LKH
OR-Tools VRPH |
| gptkbp:objective |
Minimize number of vehicles
Minimize total distance Minimize total route cost |
| gptkbp:prohibits |
Customer demand
Route length Time windows Vehicle capacity |
| gptkbp:relatedTo |
gptkb:Logistics
Last mile delivery Supply chain optimization Network optimization Optimization problem Distribution management Routing problem Travelling salesman problem |
| gptkbp:solvedBy |
Heuristic algorithms
Exact algorithms Metaheuristic algorithms |
| gptkbp:surveyedBy |
Golden, Raghavan, and Wasil, 2008
Laporte, 2009 Toth and Vigo, 2002 |
| gptkbp:usedIn |
Fleet management
Mail delivery School bus routing Waste collection Dial-a-ride services Snow plowing |
| gptkbp:bfsParent |
gptkb:Traveling_salesman_problem
|
| gptkbp:bfsLayer |
6
|