%0 Journal Article
%T Hybrid ant colony algorithm for solving TSP based on path exchanging<br>基于路径交换的求解TSP混合蚁群算法
%A LIN Dong-mei
%A WANG Dong
%A <br>林冬梅
%A 王东
%J 计算机应用
%D 2007
%I 
%X It can restrain premature of ant colony algorithms and accelerate the convergence rate of the algorithms, combining ant colony algorithms with heuristic algorithms. The solution quality and efficiency of heuristic algorithms can be improved through establishing reference optimization edge set used by local search algorithms. The strategy of path exchanging can improve convergence rate and capacity of searching optimal solution. The results of experiments indicate that new hybrid ant colony algorithm can find global optimal solution of TSP whose scale is less than 2000.
%K traveling salesman problem
%K ant colony algorithm
%K path exchanging
%K global optimal solution
%K reference optimization edge set<br>旅行商问题
%K 蚁群算法
%K 路径交换
%K 全局最优解
%K 参照优化边集
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=9134BAFB6A7BC68C&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=F3090AE9B60B7ED1&sid=2768654D5F8E2AA3&eid=117080F591027EC4&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=8