Collision Algorithm for Approximate Solution of Traveling Salesman Problem
Jiang Dong-jian · Jisuanji gongcheng · 2011
This paper proposes the thought of getting the edges of exact solution to access the approximate solution of the whole Traveling Salesman Problem(TSP).On the basic of the thought,a new algorithm called collision algorithm is designed.Experiments with the test data from internationally accepted TSPLIB in different cities and size show that the results got through the algorithm is the same or similar with current optimal solution.The algorithm can apply the TSP on a large scale as well as small scale ones.