摘要
针对几何性质的TSP问题,提出了一种“整体优先”算法,算法的核心思想是边构造边调整。实验结果表明,该算法不仅时间复杂度和空间复杂度低,寻优能力也很强,其综合性能超过目前的一些主流算法,特别适合在微机上求解TSP问题。
The paper proposes a new algorithm named whole-priority algorithm to solve geometrical TSE and the key thought of which is ＂adjusting while constructing＂. A large number of experimental results indicate that the time complexity and space complexity of the algorithm are low, and its search-optimization ability is quite strong. The comprehensive performance of the algorithm exceeds some major algorithms and it is especially suitable for solving TSP on PC.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第11期64-66,69,共4页
Computer Engineering
基金
国家自然科学基金资助项目(60673193)
湘潭大学自然科学基金资助项目(06XZX04)
湘潭大学跨学科星火项目(0509029)
