No self-introduction
Loading
Profile
Follow
codes (1)
the Capacitated Vehicle Routing Problem
4.0
The CVRP is a hard combinatorial optimisation problem. The scenario is that a set of depots contains goods to be delivered to customers by a fleet of trucks. Each customer wants a certain integer amount of goods called their demand and each truck can only carry a certain amount called its capacity . All trucks have the same capacity. The objective is to find a set of routes, one for each truck, which minimises the total distance travelled by all trucks (the 
gloriousbruce 2016-08-23
gloriousbruce 5 0
1
No more~
Follows0
Fans0