|
|||||
|
|
| 基于多样信息素的蚁群算法 | |
| 引用本文： | 高尚,孙玲芳,侯志远,杨静宇. 基于多样信息素的蚁群算法[J]. 计算机科学, 2006, 33(10): 160-162 |
| 作者姓名： | 高尚 孙玲芳 侯志远 杨静宇 |
| 作者单位： | 1. 江苏科技大学电子信息学院,镇江,212003;苏州大学江苏省计算机信息处理技术重点实验室 2. 江苏科技大学经济管理学院 3. 江苏科技大学电子信息学院,镇江,212003 4. 南京理工大学计算机系,南京,210094 |
| 摘 要： | 根据蚁群算法信息素更新的特性,提出了求解旅行商问题的多样信息素的蚁群算法。把蚁群的三种不同的信息素更新方式混合在一起,既利用了局部信息,又考虑了整体信息,将局部搜索和全局搜索相结合,使收敛性得到提高。针对旅行商问题的仿真实验结果,表明了该混合算法的有效性。 |
| 关 键 词： | 蚁群算法 信息素 旅行商问题 |
Ant Colony Optimization Algorithm Based on Multiplicate Pheromone |
|
| GAO Shang,SUN Ling-Fang,HOU Zhi-Yuan,YANG Jing-Yu. Ant Colony Optimization Algorithm Based on Multiplicate Pheromone[J]. Computer Science, 2006, 33(10): 160-162 | |
| Authors: | GAO Shang SUN Ling-Fang HOU Zhi-Yuan YANG Jing-Yu |
| Affiliation: | 1.School of Electronics and Information, Jiangsu University of Science and Technology, Zhenjiang 212003;2.Provincial Key Laboratory of Computer Information Processing Technology, Suzhou 215006;3.School of Economic and Management,Jiangsu University of Science and Technology, Zhenjiang 212003;4.Department of Computer, Nanjing University Science and Technology, Nanjing 210094 |
| Abstract: | By use of the properties of pheromone of ant colony algorithm, an ant colony algorithm based on multiplicate pheromone is proposed to solve the traveling salesman problems(TSP).Three modes of updating the pheromone are hybridized. The method uses not only local information but also global information and combines the local search with the global search to improve its convergence. The simulation results for TSP show the validity of this algorithm. |
| Keywords: | Ant colony algorithm Pheromone Traveling salesman problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机科学》浏览原始摘要信息 | |
| 点击此处可从《计算机科学》下载全文 | |