A New Genetic Algorithm for the Traveling Salesman Problem
Ting Zhang · Journal of Taiyuan University of Technology · 2008
Introduces a new genetic mutation arithmetic operators to solve the problem of difficulty in the convergence of old genetic algorithms.The concept of searching round is firstly proposed in order to make the searching space become bigger,then combines with selecting arithmetic operators and crossover arithmetic operators to form a new way to solve TSP problem.The simulated experiment shows that the new algorithm has a better performance and global searching ability than the algorithm which has single greed-mutation arithmetic operators.