计算机与数字工程2016，Vol.44Issue(9)：1664-1667,4.DOI:10.3969/j.issn.1672-9722.2016.09.008
蚁群算法在旅行商问题（TSP）中的应用研究磁
Application of the Ant Algorithm in TSP
贾燕花1
作者信息
- 1. 山西工程职业技术学院 太原 030009
- 折叠
摘要
Abstract
The traveling salesman problem(TSP) is one of the typical NP‐Complete hard problems in combinatorial op‐timization ,which is easy to be described but hard to be solved .The number of possible paths increase exponentially with the number of cities ,the solution is very hard .Ant algorithm is a newly emerged stochastic seaching optimization algorithm in recent years .It has been paid much attention to .This paper solves the TSP with this new biological optimization strategy and gives the proceses of ant algorithm .And the satisfied effect is obtained .关键词
蚁群算法 P/组合优化/TSPKey words
ant algorithm/combinatorial/TSP分类
信息技术与安全科学引用本文复制引用
贾燕花..蚁群算法在旅行商问题（TSP）中的应用研究磁[J].计算机与数字工程,2016,44(9):1664-1667,4.
