经过在数据结构和 实现方式上的改进， 算法总体平均时间复杂度为O（NlogN）。
With the improvements in the data structure and realization, the algorithm took O(NlogN)time, where N is the input size.
负载的涨落是在无限处理能力的假设下计算的。算法在平均负载的计算上进行扩展，但避免了时间复杂度的增加。
The fluctuations are calculated with the assumption of unlimited resources, where the calculation is incorporated into the calculation of the average loads without adding to the time complexity.
分析了需求不可分割带能力约束的车辆路径问题(cvrp)的2 - OPT算法计算时间的平均复杂度。
The complexity of the 2 -opt algorithm for the capacitated vehicle routing problem (CVRP) was analyzed in this paper.
应用推荐