| 蚁群算法及其在求解旅行商问题中的应用 |
| |
| 引用本文： | 米永强.蚁群算法及其在求解旅行商问题中的应用[J].数字社区&智能家居,2014(3):1505-1507. |
| |
| 作者姓名： | 米永强 |
| |
| 作者单位： | 宁夏大学数学计算机学院,宁夏银川750021 |
| |
| 摘 要： | 蚁群算法是一种求解组合优化问题较好的方法。在蚁群算法的基本原理基础上，以旅行商问题为例，介绍了该算法求解TSP的数学模型及具体步骤，并通过仿真实验与粒子群优化算法等方法比较分析，表明了该算法在求解组合优化问题方面具有良好的性能。
|
| 关 键 词： | 蚁群算法 组合优化 旅行商问题 粒子群优化算法 |
Ant Colony Algorithm and Its Application in Solving the Traveling Salesman Problem |
| |
| MI Yong-qiang.Ant Colony Algorithm and Its Application in Solving the Traveling Salesman Problem[J].Digital Community & Smart Home,2014(3):1505-1507. |
| |
| Authors: | MI Yong-qiang |
| |
| Affiliation: | MI Yong-qiang (School of Mathematics and Computer Science, Ningxia University ,Yinchuan 750022 ,China) |
| |
| Abstract: | Ant colony algorithm is a kind of good methods to solve the combinatorial optimization problems. Based on the basic principle of ant colony algorithm, for traveling salesman problem as an example this paper, this paper introduced the mathematical model of the algorithm to solve TSP and specific steps, through the simulation experiments and comparative analysis with particle swarm optimization algorithm and others, it showed the algorithm has good performance in solving combinatorial optimization problems. |
| |
| Keywords: | ant colony algorithm combinatorial optimization traveling salesman problem particle swarm optimization |
| 本文献已被 维普 等数据库收录！ |
