%0 Journal Article
%T Whole-priority algorithm for traveling salesman problem<br>求解旅行商问题的整体优先算法
%A LIU Xin
%A LIU Ren-ren
%A HOU Jing-chuan
%A <br>刘新
%A 刘任任
%A 侯经川
%J 计算机应用
%D 2007
%I 
%X To solve Euclid Traveling Salesman Problem(TSP),a new algorithm named wholepriority algorithm was proposed.The basic idea is "adjusting while constructing".During adjustment process,a creative method named reverse adjustment was adopted,to prevent the algorithm from being got in local optimization trap.Theoretical analysis and lots of experimental results indicate that the time complexity and space complexity of the algorithm are low,and its search-optimization ability is quite strong,whose comprehensive performance exceeds that of present major algorithms.
%K Traveling Salesman Problem(TSP)
%K whole-priority algorithm
%K reverse adjustment
%K global optimization<br>旅行商问题
%K 整体优先算法
%K 逆向调整
%K 全局优化
%K 求解
%K 旅行商问题
%K 优先算法
%K traveling
%K salesman
%K problem
%K 性能
%K 综合
%K 寻优能力
%K 空间复杂度
%K 时间
%K 结果
%K 实验
%K 分析
%K 理论
%K 优化陷阱
%K 局部
%K 调整方法
%K 调整路径
%K 构造
%K 整体优先
%K 欧几里德
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=33E89373F1E005A5AFACE857E3C4AD85&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=94C357A881DFC066&sid=FE01B30EDB347E58&eid=86CBF6E43FA9E551&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=20