| 一种基于格的蚁群算法 |
| |
| 引用本文： | 袁培燕. 一种基于格的蚁群算法[J]. 计算机工程与应用, 2011, 47(11): 43-45. DOI: 10.3778/j.issn.1002-8331.2011.11.013 |
| |
| 作者姓名： | 袁培燕 |
| |
| 作者单位： | 河南师范大学 物理与信息工程学院，河南 新乡 453007 |
| |
| 基金项目： | 河南省教育厅自然科学基金资助项目，河南师范大学青年科学基金资助项目 |
| |
| 摘 要： | 针对蚁群算法容易陷入局部搜索的问题，提出了一种基于格的蚁群算法。将问题空间划分为n块格子，基于随机策略，将m只蚂蚁分别放在n块格子中，对于每个格子，再次基于随机策略，将格子内的蚂蚁放置在不同的节点上。仿真结果显示，在不影响最优解的情况下，基于格的策略加速了算法的收敛性。
|
| 关 键 词： | 蚁群算法 格 性能评价 旅行商问题 |
| 修稿时间： | |
Grid based ant colony algorithm |
| |
| YUAN Peiyan. Grid based ant colony algorithm[J]. Computer Engineering and Applications, 2011, 47(11): 43-45. DOI: 10.3778/j.issn.1002-8331.2011.11.013 |
| |
| Authors: | YUAN Peiyan |
| |
| Affiliation: | College of Physics & Information Engineering，Henan Normal University，Xinxiang，Henan 453007，China |
| |
| Abstract: | To the problem of easily immersing into local search for ant colony algorithm,a grid based strategy is introduced.The space has been divided into n small portions,and then based on random strategy,m ants are put into n squares separately.For each of the square,the ants in a square are placed on different nodes based on random strategy again.Simulation results show that the grid based strategy accelerates the convergence of ant colony algorithm without sacrificing the best answer. |
| |
| Keywords: | ant colony algorithm grid performance evaluation Traveling Salesman Problem（TSP） |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
