A gene reorganize algorithm for traveling salesman problem

In this paper we present a gene reorganize algorithm for traveling salesman problem, in which we construct some approximate traveling salesman problem equivalent to the original problem by adding a perturbation matrix, and get a series of local optimal loop path by means of optimal penalty function, from which we can obtain better locally optimal one by reorganizing those branches with high frequency. Applying it deal with the massive problems, we'll see distinguished effect because of its lower calculation. At the end we give the best result for the standard ‘CHN 144’ problem currently known.