而且具体的车辆路径优化问题，往往在时间和路程两方面都有限制和要求，而在这方面的研究相对较少。
Faced to concrete routing problem, time and routs are both restricted and required and researches in this field are not enough.
第一阶段中采用分配规则将客户节点分配到各个仓库，将问题简化为多个单仓库的车辆路径优化子问题；
In the first stage the customers were assignmented to the depots and transformed the MDVRP to a set of CVRP problems;
车辆路径问题和网络流问题都是非常著名的网络优化问题。
The VRP and the network flow problem are all famous network optimization problems.
应用推荐