| 基于蚁群算法的Traveling Salesman Problem研究 |
| |
| 引用本文： | 王琛. 基于蚁群算法的Traveling Salesman Problem研究[J]. 山西师范大学学报：自然科学版, 2008, 22(4) |
| |
| 作者姓名： | 王琛 |
| |
| 作者单位： | 山西师范大学数学与计算机科学学院 |
| |
| 摘 要： | 本文介绍了一种求解复杂组合优化问题的新的拟生态算法——蚁群算法.阐述了该算法的基本原理以及蚁群算法在TSP问题上的应用,并提出了改进算法,使得算法有更好的全局性.
|
| 关 键 词： | 蚁群算法 信息素 旅行商问题 |
Research of Ant Colony Algorithm on Traveling Salesman Problem |
| |
| WANG Chen. Research of Ant Colony Algorithm on Traveling Salesman Problem[J]. Journal of Shanxi Teachers University, 2008, 22(4) |
| |
| Authors: | WANG Chen |
| |
| Abstract: | Ant colony algorithm was a novel simulated ecosystem evolutionary algorithm.After introducing the essence of the ant colony algorithm,the author gave its application in the complicated combinatorial opitimization problem such as TSP,and suggested a improved ant colony algorithm to solve TSP problems more effiently in this paper. |
| |
| Keywords: | ant colony algorithm pheromone Traveling Salesman Problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
