改进的重叠蚁群优化算法

Improved Overlap Ant Colony Optimization Algorithm

针对蚁群优化算法在进行全局最优解搜索时容易陷入局部最优解和收敛速度缓慢等缺陷,提出了一种有效求解全局最优解搜索问题的重叠蚁群优化算法。该算法通过设置多个重叠的蚁群系统,并对每一个蚁群初始化不同的参数,之后在蚁群之间进行信息素的动态学习,增强了不同蚁群对最优解的开采能力,避免了算法出现早熟现象。仿真实验结果表明,重叠蚁群优化算法在避免陷入局部最优解方面具有良好的效果,是一种提高蚁群算法性能的有效的改进算法。

Considering that the ant colony optimization （ACO） algorithm in solving global optimal solution search problems has the defects such as slow convergence and prone to local optimal solution phenomenon, this paper provides an overlap ant colony optimization （OACO） algorithm to solve global optimal solution search problem. By setting multiple overlapping ant colony, initializing different parameters of every ant colony, and learning dynamically between ant colony pheromones, OACO algorithm reinforces the exploitation of ant colony optimization algorithm and avoids premature phenomenon. The experimental results show that OACO algorithm achieves good results in avoiding falling into local optimal solution, and is an efficient and effective improved ant colony optimization algorithm.