An Algorithm Constrained by Complex Network´s Structure for Solving TSP

The genetic algorithm is easy to fall into precocious, An improved genetic algorithm is proposed to solve this problem. On the one hand, the algorithm cancels the selection operator. On the other hand, by means of the structure of a complex network, individuals´ evolutions are limited to a small population (an individual and its neighbors). The advantage of this algorithm is: first that it does not need to design too many run-parameters for the genetic algorithm. Further, it effectively avoid the premature phenomenon occurred. Experimental results show the effectiveness of the algorithm. It achieves the design purpose.