Using Gene Clusters for TSP Solving Genetic Algorithm
引入基因簇求解TSP的遗传算法

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 gene cluster was introduced into genetic operations so that the superior gene piece can be wholly inherited to descendent off-springs.After a near optimum is found,all gene clusters are smashed and the optimum finding process is continued for global optimums.Ex...