Improved Genetic Algorithm for Solving TSP Problem
Mou Lian-ming · Journal of Jiamusi University · 2009
Genetic Algorithms for Traveling Salesman Problem is a global optimization method of the probability of search algorithm.In this paper,genetic algorithm was used to find optimal solutions faster and to prevent premature convergence problem.A new classification method that the worst individuals at all levels were replaced by the current best individual in groups was proposed,in which adaptive mutation probability was used for at all levels.The genetic algorithm not only effectively improved the diversity of the groups,but also improved the convergence speed.The experimental results show that the improved algorithm is feasible and effective.