中文说明：CVRP是一个复杂的组合优化问题。该场景是一组仓库包含由一队卡车交付给客户的货物。每个客户都需要一个称为需求的整数数量的货物，而每辆卡车只能承载一个称为容量的整数数量。所有的卡车都有相同的容量。目标是找到一组路线，每辆卡车一条，使所有卡车的总行驶距离（成本）最小化，并满足所有客户的需求。所有路线的起点和终点都在车辆段。当卡车到达客户处时，它必须按客户的要求送货。一个顾客不可能有更多的顾客
English Description：
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 cost) and satisfies the demands of all customers. All routes begin and end at a depot. When a truck arrives at a customer it must deliver as much as the customer demands. A single customer cannot be served by more t