基于变异和动态信息素更新的蚁群优化算法

尽管蚁群优化算法在优化计算中已得到了很多应用,但在进行大规模优化时,其收敛时间过长仍是应用该算法的一个瓶颈.为此,提出了一种高速收敛算法.该算法采用一种新颖的动态信息素更新策略,以保证在每次搜索中,每只蚂蚁都对搜索做出贡献;同时,还采取了一种独特的变异策略,以对每次搜索的结果进行优化.计算机实验结果表明,该算法与最新的改进蚁群优化算法相比,其收敛速度提高了数十倍乃至数百倍以上.

An Ant Colony Optimization Algorithm Based on Mutation and Dynamic Pheromone Updating

Despite the numerous applications of ACO (ant colony optimization) algorithm in optimization computation, it remains a computational bottleneck that the ACO algorithm costs too much time in order to find an optimal solution for large-scaled optimization problems. Therefore, a quickly convergent version of the ACO algorithm is presented. A novel strategy based on the dynamic pheromone updating is adopted to ensure that every ant contributes to the search during each search step. Meanwhile, a unique mutation scheme is employed to optimize the search results of each step. The computer experiments demonstrate that the proposed algorithm makes the speed of convergence hundreds of times faster than the latest improved ACO algorithm.