An Improved Genetic Algorithm And Its Application In Tsp Solving

Genetic algorithms was presented by John Holland in 1975, for the complex issues not well dealed with by traditional methods such as Optimal Grouping, Matrix Recognition, Image Processing, GA can uaually give more satisfactory solutions. In recent years,GA has functioned so well with robustness and interoperability, hidden parallelity and adaptability in the settlement of problems such as function optimization of successive variable and combinatorial optimization of discrete variable that it becomes an increasingly widespread application of smart optimization algorithms.TSP(Traveling Salesman Problem),as a well known Optimal Grouping problem, it combines a broad category of the typical characteristics of the portfolio, and exists in the fields including ultra-large-scale integrated chip manufacturing, printed circuit board design, the X-ray crystallization, robotics control, and other high-tech areas in different forms.By the NP complete theory, we know that TSP is a NP hard problem, it ican not be effectively sloved to use conventional search methods. But today 1he idea of exerting nature algorithm, which is presently undergoing prompt development, to solve the problems of large-scale combinatorial opotimization, has shown extrodinary potential, one branch-GA attracts a number of researchers with unique charm.The main features of classical genetic algorithm are simplicity and robustness, almost not knowing any knowledge of the problem, so GA can not use the given information and can not solve specific issues efficiently. Therefore, we have great room for improvement in the research of using genetic algorithms for TSRThis paper has done some work in the research and application of the genetic algorithm. First, The introduction on GA's theory and its applications on combination optimization are given. Then the disadvantage of using SGA to solve TSP is further discussed At last, An improved hybrid genetic algorithm is then presented for TSP problem Considering the crossover operatior and mutation operator can affect diversity of swatchs,so the improvement on crossover operation and mutation operation is the key point.In this algorithm,,we design a new cross...