Abstract: When a genetic algorithm is used to solve the TSP （Traveling Salesman Problem）, shorter paths found before are accessible to be destroyed, and thus the convergence of the genetic algorithm slows down. To prevent the shorter paths from being destroyed, the

Key words: Traveling salesman problem,Gene cluster,Genetic algorithm