| 一种改进的蚁群算法及其在复杂TSP问题上的应用 |
| |
| 引用本文： | 朱旭燕,李原洲.一种改进的蚁群算法及其在复杂TSP问题上的应用[J].科技通报,2011,27(2):220-223. |
| |
| 作者姓名： | 朱旭燕 李原洲 |
| |
| 作者单位： | 杭州电子科技大学计算机学院,杭州,310018 |
| |
| 摘 要： | 以简单TSP问题为例描述了传统蚁群算法过程,提出了其存在的问题及解决该问题的方法.提出了复杂TSP问题的定义,结合改进后的蚁群算法提出了解决复杂TSP问题的方法.通过实验表明,改进后的蚁群算法能够用于解决复杂TSP问题.
|
| 关 键 词： | 蚁群算法 TSP 复杂TSP问题 |
An Improved Ant Colony Algorithm and Its Application on Complex TSP |
| |
| ZHU Xuyan,LI Yuanzhou.An Improved Ant Colony Algorithm and Its Application on Complex TSP[J].Bulletin of Science and Technology,2011,27(2):220-223. |
| |
| Authors: | ZHU Xuyan LI Yuanzhou |
| |
| Institution: | ZHU Xuyan,LI Yuanzhou(Computer College,Hangzhou Dianzi University,Hangzhou 310018,China) |
| |
| Abstract: | This paper describes the process of traditional ant colony algorithm,and proposes an existing problem and its solution of traditional ant colony algorithm,taking simple traveling salesman problem as example.The definition of complex traveling salesman problem has been defined.Combining the improved ant colony algorithm,a method to solve the complex traveling salesman problem has been proposed too.The improved ant colony algorithm can be used to solve complex traveling salesman problem,which is indicated by ... |
| |
| Keywords: | any colony algorithm TSP complex TSP |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
