%0 Journal Article
%T Improved Ant Colony Algorithm for Solving TSP<br>改进蚁群算法求解TSP
%A HU Lin-Lin
%A GE Hong
%A <br>胡粼粼
%A 葛红
%J 计算机系统应用
%D 2012
%I 
%X Aiming at solving the problem of falling into local optimization easily and slow convergence,this paper proposes a method that adopts a bi-level searching decision based on adjacent matrix in choosing diverting path to improve ant colony algorithm and solve TSP problem.The experiment results show that the new algorithm has better performance.
%K improved ant colony algorithm
%K TSP
%K path optimization
%K bi-level searching decision
%K global convergence<br>改进蚁群算法
%K TSP
%K 路径寻优
%K 两层搜索决策
%K 全局收敛
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D4F6864C950C88FFCE5B6C948A639E39&aid=57C6AD9B0ADA053774CC6979EF41C6A9&yid=99E9153A83D4CB11&vid=659D3B06EBF534A7&iid=94C357A881DFC066&sid=FEF02B4635FE8227&eid=A77DF0C647C3482C&journal_id=1003-3254&journal_name=计算机系统应用&referenced_num=0&reference_num=10