An Improved Genetic Algorithm for TSP
Liying Wang, Jie Zhang, Hua Li · 2007
In this paper, an improved Genetic Algorithm is proposed to solve Traveling Salesman Problem (TSP). In order to improve the performance of Genetic Algorithm, untwist operator is introduced. The untwist operator can untie the knots of route effectively, so it can shorten the length of route and quicken the convergent speed. The computation with experimental data shows the untwist operator and the solving method are effective.