The complexity of the 2 -opt algorithm for the capacitated vehicle routing problem (CVRP) was analyzed in this paper.
分析了需求不可分割带能力约束的车辆路径问题(cvrp)的2 -OPT算法计算时间的平均复杂度。
In the first stage the customers were assignmented to the depots and transformed the MDVRP to a set of CVRP problems;
第一阶段中采用分配规则将客户节点分配到各个仓库，将问题简化为多个单仓库的车辆路径优化子问题；
In the first stage the customers were assignmented to the depots and transformed the MDVRP to a set of CVRP problems;
第一阶段中采用分配规则将客户节点分配到各个仓库，将问题简化为多个单仓库的车辆路径优化子问题；
应用推荐