计算机工程与应用2011，Vol.47Issue(26)：232-234,245,4.DOI:10.3778/j.issn.1002-8331.2011.26.066
车辆配送路径优化的新型蚁群算法
New ACO algorithm for optimizing of vehicle distribution routing
范小宁 1徐格宁 1杨瑞刚1
作者信息
- 1. 太原科技大学机电工程学院,太原030024
- 折叠
摘要
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分类
通用工业技术引用本文复制引用
范小宁,徐格宁,杨瑞刚..车辆配送路径优化的新型蚁群算法[J].计算机工程与应用,2011,47(26):232-234,245,4.
