蚁群算法的收敛性分析及其在TSP上的求解  

Convergence Analysis of Ant Colony Algorithm and Application in TSP

作　　者：方旺盛[1] 肖琴[1] 

机构地区：[1]江西理工大学信息工程学院,赣州341000

出　　处：《计算机与数字工程》2007年第9期46-48,共3页Computer & Digital Engineering

摘　　要：根据基本蚁群算法的特点对其收敛性进行分析,给出寻找最短路径的蚁群算法收敛的充分条件。并把算法运用到旅行商问题上,试验结果表明该算法在求解TSP问题上解的精度优于组合优化算法以及遗传算法且收敛速度比较快。Based on the characteristic of ant colony algorithm,this paper brings forward the convergence analysis of ant colony algorithm for solving shortest path problem. The theorems establish sufficient condition for the convergence ant colony algorithm for solving shortest path problem. The numerical experiment on solving tsp problem show the efficiency of the result .And it can see compare to the combination optimization algorithm and the genetic algorithm the ant colony algorithm for solving the tsp problem can find the better value and the convergence speed is faster.

关 键 词：蚁群算法 收敛性 旅行商问题 遗传算法 组合优化 

分 类 号：TP273.4[自动化与计算机技术—检测技术与自动化装置]