| 基于蚁群算法的集合覆盖问题 |
| |
| 引用本文： | 葛洪伟,高阳.基于蚁群算法的集合覆盖问题[J].计算机工程与应用,2007,43(4):49-50,105. |
| |
| 作者姓名： | 葛洪伟 高阳 |
| |
| 作者单位： | 江南大学,信息学院,江苏,无锡,214036 |
| |
| 摘 要： | 蚁群算法是一种基于群体智能原理的优化模型,用于解决组合优化问题。集合覆盖问题是NP完全问题中应用面最广的问题之一,它在模式识别、机器学习等领域中具有重要的应用。以SCHF1]启发函数作为启发信息,用蚁群算法求得集合覆盖问题的优化解。通过几种算法的仿真结果对照表明,用蚁群算法求解集合覆盖问题是有效的,蚁群算法得到的解是比较理想的。
|
| 关 键 词： | 蚁群算法 群体智能 集合覆盖 NP完全问题 |
| 文章编号： | 1002-8331（2007）04-0049-02 |
| 修稿时间： | 2006-05 |
Ant colony algorithm for solving set-covering problems |
| |
| GE Hong-wei,GAO Yang.Ant colony algorithm for solving set-covering problems[J].Computer Engineering and Applications,2007,43(4):49-50,105. |
| |
| Authors: | GE Hong-wei GAO Yang |
| |
| Affiliation: | College of Information Engineering,Southern Yangtze University,Wuxi,Jiangsu 214036,China |
| |
| Abstract: | Ant colony algorithm is an optimized model which bases on the principle of swarm intelligence,it is used to solve the problem of optimization.We use ant colony algorithm to find the optimization solution of the set-covering problems,while set-coveting is one of the most popular application in NP-complete problem,it has important application,such as in the field of mode identity,machine learning and so on.The contrast of several algorithm proves that using the ant colony algorithm to solve the problem of set covering is efficiency and feasible. |
| |
| Keywords: | Ant Colony Algorithm colony intelligence set-covering NP-complete problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
