| 基于TSP的蚁群退火混合算法研究 |
| |
| 引用本文： | 王琛. 基于TSP的蚁群退火混合算法研究[J]. 山西师范大学学报：自然科学版, 2014, 0(3): 18-21 |
| |
| 作者姓名： | 王琛 |
| |
| 作者单位： | 山西师范大学数学与计算机科学学院 |
| |
| 摘 要： | 本文介绍了蚁群算法和模拟退火算法的基本原理及优缺点,详细阐述了这两种不同混合算法在旅行商问题中的实现流程.
|
| 关 键 词： | 蚁群算法 模拟退火算法 旅行商问题 |
Research on Ant Colony Annealing Hybrid Algorithm Based on TSP |
| |
| WANG Chen. Research on Ant Colony Annealing Hybrid Algorithm Based on TSP[J]. Journal of Shanxi Teachers University, 2014, 0(3): 18-21 |
| |
| Authors: | WANG Chen |
| |
| Affiliation: | WANG Chen;School of Mathematics and Computer Science,Shanxi Normal University; |
| |
| Abstract: | In this paper,introduces the basic principle,advantages and disadvantages of ant colony algorithm and the simulated annealing algorithm are introduced. The implementation process of elaborated on two different hybrid algorithm in the traveling salesman problem is elaborated. |
| |
| Keywords: | ant colony algorithm simulated annealing algorithm traveling salesman problem |
| 本文献已被 CNKI 维普 等数据库收录！ |
