Improved genetic algorithm in solving TSP problem

A new genetic algorithm is proposed to solve the problem of TSP(traveling salesman problem).The genetic operators of coding and crossover and mutation are redesigned,and the drawbacks of that the coding and genetic operations of SGA could not fully reflect the genetic information are overcomed,and the randomicity of traditional genetic search is greatly reduced.The experimental re-sults show the new GA has great advantage over many existing genetic algorithms.