摘要
为克服现有蚁群算法运算过程中收敛速度慢, 易出现停滞现象等缺点, 提出了一种结合模拟退火策略的改进算法。利用向原始蚁群中引入逆向蚂蚁, 并结合模拟退火思想确定蚁群中逆向蚂蚁的数目, 来提高算法的适应性。将该算法应用于旅行商问题的求解, 仿真试验结果表明该算法的收敛速度和全局寻优能力都得到很大的改善。
In order to get over the disadvantages of the slow convergence speed and stagnation behavior, a new ant colony algorithm 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. The algorithm can solve the Traveling Salesman Problem. The simulated results show that the ability of optimization and the convergence speed have improved a lot.
出处
《微计算机信息》
北大核心
2006年第12S期265-267,共3页
Control & Automation
基金
天津市教委资助
天津市高等学校科技发展基金项目(项目编号:20051206)
关键词
蚁群算法
旅行商问题
模拟退火
ant colony algorithm, traveling salesman problem,simulated annealing
