Improved Genetic Algorithm for Optimizing TSP Problem

Abstract

Based on the analysis of the existing characteristics of genetic algorithm and traditional genetic algorithm in the problem, proposed to solve the traveling salesman problem by genetic algorithm framework, constructing appropriate to establish effective genetic operations (Traveling Sales man Problem) method for the TSP problem, through to the population size, the number of iterations, the crossover probability and mutation the probability of selection, the final verification of the superiority of the improved genetic algorithm in the optimization problem in TSP.