An Optimized Genetic Algorithm for TSP

It is difficult to find out a precise answer to TSP (Traveling Salesman Problem). But GA (Genetic Algorithm) can find a better answer to it. This paper introduce GA and its essence. Then TSP, which is based on GA, is presented. In this paper main operators in GA, such as crossover operators and mutation operators, are analyzed and compared. By employing. heuristic crossover and inversion mutation, a new method based on genetic algorithm for solving TSP is presented. The experimental results simulated on TSP show that this algorithm is feasible and effective to solve. TSP. Employing heuristic crossover and inversion mutation can prevent premature convergence and ensure that the population is diverse, like what happens in the nature.