计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (26): 232-234.

• 工程与应用 • 上一篇    下一篇

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

范小宁,徐格宁,杨瑞刚   

  1. 太原科技大学 机电工程学院,太原 030024
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-09-11 发布日期:2011-09-11

New ACO algorithm for optimizing of vehicle distribution routing

FAN Xiaoning,XU Gening,YANG Ruigang   

  1. College of Mechanical and Electronic Engineering,Taiyuan University of Science and Technology,Taiyuan 030024,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-09-11 Published:2011-09-11

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

关键词: 车辆配送, 路径优化, 蚁群算法, 编码方式, 转移概率

Abstract: 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.

Key words: vehicle distribution, optimizing routing, Ant Colony Optimization(ACO), encoding method, transition rule