An Improved Evolutionary Algorithm for Traveling Salesman Problem Based on Inver-Over Operator
Minjun Jiang · Computer Technology and Development · 2007
The evolutionary algorithm using inver-over operator for the traveling salesman problem(TSP) has great ascendancy,because its ability in global searching for optimal individual is powerful.However,it has the some limitations: low executive efficiency and the dissatisfactory average individuals obtained by algorithm.To avoid these limitations,improves the algorithm mentioned above in three aspects: close-by visit method,dynamic mutation probability and greedy search based on preferable individuals.A desirable result is obtained.It is showed by the experiment that the algorithm can be executed with high efficiency and the average quality of the optimal individual of the algorithm is improved.