| 蚁群优化算法的原理及其应用 |
| |
| 引用本文： | 陈昊. 蚁群优化算法的原理及其应用[J]. 湖北大学学报(自然科学版), 2006, 28(4): 350-352 |
| |
| 作者姓名： | 陈昊 |
| |
| 作者单位： | 湖北大学,数学与计算机科学学院,湖北,武汉,430062 |
| |
| 摘 要： | 蚁群优化算法是近年来出现的一种新的启发式搜索算法,首先介绍了蚁群算法的基本原理,然后着重讨论了如何将其用于求解旅行商问题(TSP),最后分析了蚁群算法的一些基本特征.
|
| 关 键 词： | 蚁群算法 NP难 旅行商问题 信息素 |
| 文章编号： | 1000-2375(2006)04-0350-03 |
| 收稿时间： | 2005-09-14 |
| 修稿时间： | 2005-09-14 |
The principle and application of ant colony optimization |
| |
| CHEN Hao. The principle and application of ant colony optimization[J]. Journal of Hubei University(Natural Science Edition), 2006, 28(4): 350-352 |
| |
| Authors: | CHEN Hao |
| |
| Affiliation: | School of Mathematics and Computer Science, Hubei University, Wuhan 430062, China |
| |
| Abstract: | Ant colony optimization algorithm is a novel heristic search strategy in recent years.The principle of ant colony algorithm is introduced and its application to the Traveling Salesman Problem(TSP) is mainly discussed.Conclusions are made with the investigation of several essential features of ACO. |
| |
| Keywords: | ant colony algorithm NP hard TSP pheromone |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
