Improved Genetic Algorithm And Application

Real-coded genetic annealing algorithm based on distance measurement is a new algorithm for global-searching which proposed by Cai Liang Wei in 2004. The algorithm has been improved in this paper, it defined the mutation probability according to distance measurement and fitness, adopted improved crossover and simulated annealing operation. In addition, when population tended to uniform, it reserved the best individual and reproduced other individuals. Applying it to the function optimization problem with boundary constraints, the simulated results show that the improved algorithm is more effective in realizing the high convergence probability and rapid evolving speed. In order to solve TSP problem, it defined the crossing probability based on distance measurement and fitness, adopted improved exchange heuristic crossover operator, which the new individual is no worse than the old one. According to the difference between the best individual and the better individual, it adopted the method that use double exchange produce new individuals or do simulated annealing operation. The simulated results show that the new algorithm has high convergence probability and the generation numbers is far less than other comparative algorithms .