Solution and simulation of TSP problem based on genetic algorithm
Liu Fu-xian · Electronics Optics & Control · 2007
In Traveling Salesman Problem(TSP),illegal routes may be produced by genetic operations using the traditional encoding method.To avoid this problem,a new encoding method is presented.With the new method,it is easy to implement genetic operations,and it is not necessary to adjust the illicit gene parts in children individuals.To prevent premature convergence and solve the conflict between the convergence speed of genetic algorithm and that of the global convergence,Doping strategy and parameter switch method are used.Experimental result shows that these methods can help to enhance the capabilities of global convergence and avoid premature convergence,and the algorithm is efficient for solving TSP problems with different scales.