车辆配送路径优化的新型蚁群算法

New ACO algorithm for optimizing of vehicle distribution routing

构造了求解车辆配送路径优化问题的新型蚁群算法,采用新型的编码方式和转移概率,避免了遗传算法求解该问题所存在的遗传算子设计困难和遗传操作繁琐复杂的现象及现有蚁群算法求解该问题时收敛速度慢的缺陷。通过实例验证了所构建的算法与现有算法相比,不仅操作简单而且具有更好的收敛性。

A new Ant Colony Optimization（ACO） algorithm for the optimizing of vehicle distribution routing is constructed.Since the algorithm adopts a new kind of encoding method and transition rule,on the one hand,the phenomena that the designing of genetic operators is difficult and the genetic operation is complicated by using Genetic Algorithm（GA） to solve the Vehicle Routing Problem（VRP） are avoided,on the other hand,the shortcoming that the convergence speed is slow by applying the ACO to do so is overcomed.Examples demonstrate that the constructed algorithm features simpler operation and better convergence,compared with the current algorithms.