| 最大—最小蚂蚁系统及K-TSP问题的求解 |
| |
| 引用本文： | 冷画屏,汪明慧,余永权. 最大—最小蚂蚁系统及K-TSP问题的求解[J]. 计算机应用与软件, 2008, 25(2): 242-244 |
| |
| 作者姓名： | 冷画屏 汪明慧 余永权 |
| |
| 作者单位： | 1. 广东工业大学计算机学院,广东,广州,510000;海军兵种指挥学院,广东,广州,510430
2. 广东工业大学计算机学院,广东,广州,510000 |
| |
| 摘 要： | 蚂蚁算法目前已得到广泛的运用.为克服基本蚂蚁算法容易出现停滞现象等缺陷,许多学者提出了改进的蚂蚁算法.最大-最小蚂蚁系统是其中性能最优良的蚂蚁算法.在简述基本蚂蚁算法及最大-最小蚂蚁系统对其改进的基础上,实现了用最大-最小蚂蚁系统求解K-TSP问题的算法,列出了求解结果,并与文献[7]中的结果进行了对比,指出最大最小蚂蚁系统是求解K-TSP问题的有效算法.
|
| 关 键 词： | 最大-最小蚂蚁系统 K-TSP 智能计算 |
| 收稿时间： | 2006-01-30 |
| 修稿时间： | 2006-01-30 |
MAX-MIN ANT SYSTEM AND SOLUTION TO K-TSP PROBLEM |
| |
| Leng Huaping,Wang Minghui,Yu Yongquan. MAX-MIN ANT SYSTEM AND SOLUTION TO K-TSP PROBLEM[J]. Computer Applications and Software, 2008, 25(2): 242-244 |
| |
| Authors: | Leng Huaping Wang Minghui Yu Yongquan |
| |
| Affiliation: | Leng Huaping(1,2) Wang Minghui1 Yu Yongquan1 ()1(School of Computer,Guangdong University of Technology,Guangzhou 510000,Guangdong,China) ()2(Guangzhou Naval Academy,Guangzhou 510430,China) |
| |
| Abstract: | Ant algorithm has been widely used after it was proposed by Italian scholar Dorigo M.In order to overcome its shortcomings such as easy occurrence of stagnation behavior,a few improved ant algorithms are put forward.Among them,Max-Min ant system is the best algorithm.The basic ant algorithm and Max-Min ant system are introduced,and Max-Min ant system is applied to solve K-TSP problem.The results are presented and compared with reference[7],which shows that Max-Min ant system is an efficient algorithm for K-... |
| |
| Keywords: | Max-Min ant system K-TSP Intelligent algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
