Computer and Modernization

Previous Articles     Next Articles

Research on TSP Problem Based on Crossover and Mutation Combination

  

  1. (1. School of Information Science and Technology, Northeast Normal University, Changchun 130117, China;
    2. Jilin Province “Internet Plus” Education Science and Technology Innovation Center, Changchun 130117, China; 
    3. Software College of Jilin University, Changchun 130117, China)
  • Received:2017-06-26 Online:2018-04-03 Published:2018-04-03

Abstract: Genetic algorithm is a kind of random search algorithm based on natural selection and natural genetic mechanism, which is a relatively common algorithm for solving TSP problem. However, when the algorithm solves the TSP problem, there is a problem that the convergence speed is slow and easy to get premature. This paper proposes an algorithm design that combines five kinds of crossover algorithms and three kinds of mutation algorithms, then achieves 15 kinds of combination methods, and then uses Java language programming experiment, and finally through the Chinese 144 (CHN144), it is proved that the genetic algorithm combined with the THGA algorithm and the reverse order mutation algorithm can solve the traveling salesman problem by using the combination of the crossover algorithm and the mutation algorithm to achieve the best results.

Key words: genetic algorithm, TSP problem, THGA, reverse order mutation

CLC Number: