基于模拟退火算法的多道逆向蚁群算法

Multiple converse ant colony algorithm based on simulated annealing

为克服现有蚁群算法运算过程中易出现停滞现象、收敛速度慢等缺点,提出了一种基于模拟退火策略的多道逆向蚁群算法。通过向原始蚁群中引入逆向蚂蚁,并结合模拟退火思想确定蚁群中逆向蚂蚁的数目,来提高算法全局寻优能力。在算法执行过程中一组蚂蚁分成几群并行运算,通过交换策略,有效地利用了当前最优解,提高了算法收敛速度。将该算法应用于旅行商问题的求解,仿真实验结果表明该算法的全局寻优能力和收敛速度都得到了很大改善。

In order to get over the disadvantages of stagnation behavior and the slow convergence speed,a multiple converse ant colony algorithm based on simulated annealing is proposed.Inducting converse ants into the ant colony and the number of converse ants is adjusted by simulated annealing,the ability of searching for global optimal solution can be improved.Parallel running of a group of colonies are used in such a way that they can share their information effficiently,this information can be utilized by colonies via an exchange colonies,the ability of stagnation behavior can be improved.Using this algorithm to solve the traveling salesman problem shows that the ability of optimization and the convergence speed have improved a lot.