%0 Journal Article
%T Improved ant colony algorithm for solving TSP<br>求解TSP的改进蚁群算法
%A HOU Wen-jing
%A MA Yong-jie
%A ZHANG Yan
%A SHI Yu-jun
%A <br>侯文静
%A 马永杰
%A 张燕
%A 石玉军
%J 计算机应用研究
%D 2010
%I 
%X Aimed at the shortcomings, which needing much time and easier to fall in local optimal solution in the ant colony algorithm, this paper proposed an improved algorithm. Through employing the list of candidate cities in the initial pheromone matrix to decrease inferior solutions and using cluster to do the second search in the local search, it could narrow the searching range of algorithm, could improve the quality of the solution space and raise the searching speed. The simulations result for TSP shows that the algorithm is improved greatly in convergence rate and ability of global optimization.
%K ant colony algorithm(ACA)
%K TSP
%K list of candidate cities
%K clustering
%K ant colony system(ACS)<br>蚁群算法(ACA)
%K 旅行商问题
%K 候选城市列表
%K 聚类
%K 蚁群系统（ACS）
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=AD9DD104E53B0382DE1B56B021EBA479&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=B31275AF3241DB2D&sid=5B4FE8EC29FFFACE&eid=F732F37FA82B687C&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11