A New Hybrid Genetic Algorithm for Traveling Salesman Problem
Xianxu Li · Computer and Modernization · 2010
The paper presents an improved hybrid genetic algorithm to solve the Traveling Salesman Problem(TSP).Based on the traditional genetic algorithm,Guo Tao algorithm is introduced to the crossover operation,which keeps good diversity and global search capability to overcome the shortcomings of premature convergence.PSO algorithm is introduced to the mutation operation,which accelerates the convergence rate,improves the solution quality,and finds the optimal solution more quickly.Verified by many examples from TSPLIB,the obtained results are better than the available optimal solutions,which demonstrate the efficiency and efficacy of the algorithm.