[1]章义刚 贾瑞玉 张燕平 王会颖.快速蚁群算法求解圆排列问题[J].计算机技术与发展,2007,(08):48-50.
ZHANG Yi-gang,JIA Rui-yu,ZHANG Yah-ping,et al.Quick Ant Colony Algorithm of Solving Circle Permutation Problem[J].,2007,(08):48-50.
点击复制
快速蚁群算法求解圆排列问题(
)
《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]
- 卷:
-
- 期数:
-
2007年08期
- 页码:
-
48-50
- 栏目:
-
智能、算法、系统工程
- 出版日期:
-
1900-01-01
文章信息/Info
- Title:
-
Quick Ant Colony Algorithm of Solving Circle Permutation Problem
- 文章编号:
-
1673-629X（2007）08-0048-03
- 作者:
-
章义刚1; 2 贾瑞玉1 张燕平1 王会颖1
-
[1]安徽大学计算机学院[2]合肥学院
- Author(s):
-
ZHANG Yi-gang ; JIA Rui-yu; ZHANG Yah-ping ; WANG Hui-ying
-
[1]Artillery Academy of PLA[2] School of Computer Science and Engineering, Anhui University[2]Hefei University
-
- 关键词:
-
圆排列问题快速蚁群算法; 圆排列问题蚁群算法; 遗传算法
- Keywords:
-
CPPQACA; CPPACA; genetic algorithm
- 分类号:
-
TP301
- 文献标志码:
-
A
- 摘要:
-
圆排列问题属于NP-完全问题,且蚁群算法已成功地解决了许多组合优化的难题。介绍一种基于蚁群算法求解圆排列问题的算法,并对此算法进行优化,提出一种求解圆排列问题的快速蚁群算法。它大大减少了蚁群算法的搜索时间,有效改善了蚁群算法易于过早地收敛于非最优解的缺陷。仿真实验取得了较好的结果
- Abstract:
-
Circle permutation problem is a difficult NP problem. Ant colony algorithm was applied successfully to many hard combinational optimization problems. An ant colony algorithm of solving circle permutation problem is intrcduced. By optimizing it, a quick ant colony algorithm of solving circle permutation problem is presented. It greatly reduces the searching time of ant colony algorithm. It also effectively ameliorates the disadvantage of easily falling in local best of ant colony algorithm. The simulation results show that the algorithm is more efficient
备注/Memo
- 备注/Memo:
-
安徽省教育厅科研资助项目（2006KJ088B,2005KJ056）章义刚（1965-），男，安徽南陵人，工程师，研究方向为群体智能；张燕平，教授，研究方向为人工智能、机器学习
更新日期/Last Update:
1900-01-01