An Improved Hybrid Genetic Algorithm for Traveling Salesman Problem

@article{Wang2009AnIH,
  title={An Improved Hybrid Genetic Algorithm for Traveling Salesman Problem},
  author={Suihua Wang and Ailing Zhao},
  journal={2009 International Conference on Computational Intelligence and Software Engineering},
  year={2009},
  pages={1-3}
}
Traveling Salesman Problem (TSP) is a typical NPcomplete problem which lacks polynomial time algorithm. In this paper, an improved ε-hybrid genetic algorithm framework is presented, the application of which in solving the TSP is also introduced. It applies both global search strategy and local search strategy to ensure the searching breadth as well as the solution precision. It adds a local search process in the standard genetic algorithm. When the best individual of every generation is found… CONTINUE READING