The Performance Analysis of Two Vertices Combination Algorithm in Solving Traveling Salesman Problem

Two vertices combination algorithm is a kind of improved algorithm on loops.Comparing this method with ant colony algorithm,its time complexity and computational accuracy are better than those of the latter.The results show that this proposed algorithm possesses a better practicability in solving the middle and small scale traveling salesman problem.