【摘要】 针对欧几里德旅行商问题,提出了一种“整体优先”算法。该算法的基本思路是边构造边调整路径,在调整中采用了独创的逆向调整方法,避免算法陷入局部优化陷阱。理论分析和大量实验结果表明,该算法不仅时间复杂度和空间复杂度低,寻优能力也相当强,其综合性能超过目前的一些主流算法。更多还原

【Abstract】 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.更多还原