An improved genetic algorithm for solving the Traveling Salesman Problem

In this paper, on the basis of the original genetic algorithm, an improved genetic algorithm for the Traveling Salesman Problem (TSP) is proposed. Firstly, the diversity of species is ensured by amending the calculation method of the individual fitness. Secondly, the mutation operator is improved by the combination of shift mutation and insertion mutation. Before the crossover, the operator checks whether the degradation phenomenon will occur. Finally, experimental results further determine that above improvements provide a significant effect for solving the TSP.