关键词: 遗传算法, 二次变异, 旅行商问题（TSP）, 种群多样性, 搜索能力

Abstract: Simple genetic algorithm is improved by using single point mutation and inversion mutation operators. The algorithm is applied to Traveling Salesman Problem（TSP）. Simulation results show the diversity of population can be also improved by uising the modified algorithm. The local search capacity of the algorithm is effectively improved. The algorithm can find better solution than the simple genetic algorithm. In addition, the improved genetic algorithm has higher sensitivity for population size. Under the same conditions, when the population size increases, the improved algorithm can get a better solution.

Key words: genetic algorithm, double mutation, Traveling Salesman Problem（TSP）, diversity of the population, search capacity