An inner and outer ring heuristic algorithm for TSP

This article proposed an algorithm for solving traveling salesman problem from the perspective of geometry. At a given planar point distribution, search remote border points and connect these points to form a polygon circuit called outer ring including all the points, according to the same principle, search a polygon inner ring circuit among the points that aren´t in outer ring . According to the principle that points add to the polygon minimize the circuit circumference, add inner ring circuit points to outer ring in proper order, add the surrounded points to the inner ring circuit, a outer ring circuit spread all over points was formed at last. Experimental result shows that this algorithm can obtain a satisfied stable result and has advantage in the solving speed.