Improvement of genetic algorithm of TSP

The basic principles of genetic algorithms and solving steps are overviewed. To deal with problems for basic genetic algorithm in solving the TSP( traveling salesman problems) including slow convergence,vulnerability of population diversity and liability to converge to local optimal solution, several algorithms as improvement of the basic genetic algorithm are introduced such as two-stage genetic algorithm,coarse-grained genetic algorithm and hybrid genetic algorithm,etc. The basic principles, parameter setting and operation method of genetic operator of these improved genetic algorithm are analyzed. The operating steps of these improved genetic algorithm and their advantages and disadvantages in solving the TSP problem are obtained. Finally,the future trends of genetic algorithm in solving TSP problem are proposed.