Draw on improved C-W saving algorithm for non-full load transportation.
对于非满载运输，借鉴改进的C - W节约算法的基本思想等。
At the same time, the basic principle of the saving algorithm is described, and the question of VRP was resolved using better saving.
同时，论述了节约算法的基本原理并采用改进的节约算法对配载车辆调度问题进行求解，即在基本的节约算法中加入时间窗约束条件。
According to the different priority and the thought of saving algorithm, the routing which has the least cost is the one we want to get.
根据节约算法的思路，求得的综合成本最低的那条线路即为我们要求的方案。
应用推荐