Whole-priority algorithm for traveling salesman problem
Hou Jingchuan · Journal of Computer Applications · 2007
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.