SOLVING TSP BASED ON AN IMPROVED GENETIC ALGORITHM
Ruan Huai · 2003
TSP(Traveling Salesman Problem)is a typical NP complete problem,genetic algorithm is the perfect method for solving NP complete problem.This paper proposes a new genetic algorithm using the maintaining variety mechanism to design the selection mechanism of the algorithm in order to improve the algorithm capability. We also use this algorithm to resolve the TSP and get the perfect results.