Research on TSP solution based on genetic algorithm of Logistic equation

The TSP is a NP problem. There are many genetic algorithm methods to solve the problem. The thesis put forward a new selective operator which can improve the genetic algorithm by heuristic information based on the changing characters of combinatorial information in TSP problem and the Logistic equation. This method can help the genetic algorithm to solve the TSP problems. The thesis also attempted to give some ways to avoid part optimization problem of the genetic algorithm.