Optimal Clumping Principle and Clumping Method to Solve Traveling Salesman Problem
Yong Liu · Systems engineering and electronics · 2002
This paper advances the optimal clumping principle which is the basic principle of computation complexity for solving the minimizing problems of the algorithm sets and calculus sets and the NP-complete problems. Two ideas, i.e. dense algorithm and cavernous algorithm, are introduced. Based on the above principle and ideas, a clumping method with geometric algorithm, ecological algorithm and decision problem approximate calculi to solve traveling salesman problem is presented. The arithmetic process is detailed in this paper. Experimental results show the validity of the principle and the exquisiteness of the method.\;