Journal of System Simulation ›› 2022, Vol. 34 ›› Issue (8): 1811-1819.doi: 10.16182/j.issn1004731x.joss.21-0203

• Modeling Theory and Methodology • Previous Articles     Next Articles

Bioinformation Heuristic Genetic Algorithm for Solving TSP

Jia Xu(), Fengqing Han(), Qixin Liu, Xiaoxia Xue   

  1. Chongqing Jiaotong University, Chongqing 400046, China
  • Received:2021-03-15 Revised:2021-06-10 Online:2022-08-30 Published:2022-08-15
  • Contact: Fengqing Han E-mail:Xujia051097@163.com;990020606030@cqjtu.edu.cn

Abstract:

Genetic algorithm (GA) is one of the universal path optimization algorithms for traveling salesman problem (TSP). Aiming at the slow convergence and unstable solution of the traditional GA, a bioinformation heuristic genetic algorithm (BHGA) is proposed. By optimizing the fitness function and initial population, the gene sequence comparison technique in bioinformatics is introduced to carry out the cross recombination sorting. The gene reversal operation is used to implement mutation, to accelerate the convergence speed and get a better path solution. The numerical examples in TSPLIB database are solved by BHGA and the experimental simulation results show that the algorithm is effective and the solution of the medium and small scale TSP data are stable.

Key words: traveling salesman problem (TSP), improved genetic algorithm, gene sequence comparison, fitness function, equivalence matrix

CLC Number: