Statements (30)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
gptkb:transportation
logistics supply chain management |
| gptkbp:field |
combinatorial optimization
operations research |
| gptkbp:formedBy |
1959
|
| gptkbp:fullName |
Capacitated Vehicle Routing Problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
CVRP
|
| gptkbp:input |
vehicle fleet
customer demands set of customers vehicle capacity |
| gptkbp:notableFor |
branch and bound
genetic algorithm tabu search Clark-Wright savings algorithm |
| gptkbp:NP-hard |
true
|
| gptkbp:objective |
minimize total route cost
|
| gptkbp:origin |
operations research literature
|
| gptkbp:output |
set of vehicle routes
|
| gptkbp:prohibits |
each customer visited once
total demand per route ≤ vehicle capacity vehicle capacity |
| gptkbp:relatedTo |
gptkb:Traveling_Salesman_Problem
gptkb:vehicle_routing_problem Split Delivery VRP VRP with Time Windows |
| gptkbp:bfsParent |
gptkb:Clean_Vehicle_Rebate_Project
|
| gptkbp:bfsLayer |
8
|