Genetic Algorithm Based on Good Character Breed for Traveling Salesman Problem

Genetic algorithm based on good character breed is presented, which imitates breeding good character seeds in biology. Genetic algorithm runs several times to build a seed set. Searching space of traveling salesman problem is rationally divided into segments based on the fine seed, for it is similar as optimum in structure. Evolution strategy combines with cut algorithm for the better resolution of large-scale TSP. The technique of open routing optimization and the technique of overlapping segments are used to solve the problem of end points of segments connection and optimization. The processes using the algorithm for eil101 and ch150 in TSPLIB give examples how to solve TSP. The results show that the genetic algorithm based on good character breed for TSP is efficient.