A New Hybrid Algorithm to Solve Euclidean Plane TSP
Xiaochun Xue · Computer and Modernization · 2010
Traveling salesman problem(TSP) is a classic combinatorial optimization problem.This paper uses an insertion method which is based on convex polygon to form loop,then applies the adjustment algorithm to shorten the loop.At last the paper uses the crossover operator which is from the genetic algorithm to optimize the loop.The result of calculation shows that the method has high precision and good practicability.