A Novel Genetic Algorithm and Its Application in TSP

A novel was proposed for the defections of slow convergence and liable to "premature" of traditional GA. It creates crossover and mutation by merging two kinds of heuristics respectively so as to improve the local search ability of GA, and then imports the exterior best-individual set to increase the diversity of the group. The further theoretical analysis and discussion was carried out. simulation results indicated that it can get high-quality solution and consume less running time.