An Improved Genetic Algorithm for TSP

  title={An Improved Genetic Algorithm for TSP},
  author={Li-Ying Wang and Jie Zhang and Hua Li},
  journal={2007 International Conference on Machine Learning and Cybernetics},
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.