| 基于模拟退火策略的逆向蚁群算法 |
| |
| 引用本文： | 刘玉霞,王萍,修春波. 基于模拟退火策略的逆向蚁群算法[J]. 微计算机信息, 2006, 22(34): 265-267 |
| |
| 作者姓名： | 刘玉霞 王萍 修春波 |
| |
| 作者单位： | 300160,天津,天津工业大学计算机技术与自动化学院 |
| |
| 基金项目： | 天津市教委资助项目;天津市教委资助项目 |
| |
| 摘 要： | 为克服现有蚁群算法运算过程中收敛速度慢, 易出现停滞现象等缺点, 提出了一种结合模拟退火策略的改进算法。利用向原始蚁群中引入逆向蚂蚁, 并结合模拟退火思想确定蚁群中逆向蚂蚁的数目, 来提高算法的适应性。将该算法应用于旅行商问题的求解, 仿真试验结果表明该算法的收敛速度和全局寻优能力都得到很大的改善。
|
| 关 键 词： | 蚁群算法 旅行商问题 模拟退火 |
| 文章编号： | 1008-0570(2006)12-1-0265-03 |
| 修稿时间： | 2006-03-12 |
Converse Ant Colony Algorithm Based on Simulated Annealing |
| |
| LIU YUXIA,WANG PING,XIU CHUBO. Converse Ant Colony Algorithm Based on Simulated Annealing[J]. Control & Automation, 2006, 22(34): 265-267 |
| |
| Authors: | LIU YUXIA WANG PING XIU CHUBO |
| |
| Affiliation: | LIU YUXIA WANG PING XIU CHUBO |
| |
| Abstract: | n 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 re- sults show that the ability of optimization and the convergence speed have improved a lot. |
| |
| Keywords: | ant colony algorithm traveling salesman problem simulated annealing |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
