摘要
介绍了一种求解TSP问题的算法—改进的蚁群算法,算法通过模拟蚁群搜索食物的过程,可用于求解TSP问题,算法的主要特点是:正反馈、分布式计算、与某种启发式算法相结合.通过对传统蚁群算法的改进可以得到较好的结果.计算机仿真结果表明了该算法的有效性.
This paper introduces an algorithm for solving TSP problems - an improved ant colony algorithm. By simulating the process of searching for food by ant, the algorithm can be used to solve the TSP. The main features of the algorithm are： positive feedback, dis- tributed computation, and combined with a heuristic algorithm. Through the improvement of traditional ant colony algorithm ,we can get better results.Computer simulation results shows the effectiveness of the algorithm.
出处
《数学的实践与认识》
CSCD
北大核心
2012年第4期133-140,共8页
Mathematics in Practice and Theory
基金
2009年国家自然科学研究基金(60876077)
2009年山西省自然科学研究基金(2009011018-3)
关键词
TSP
蚁群算法
TSP
Ant colony algorithm
