Using the complex network for solving TSP problem

摘要

This paper puts forward a new algorithm (Complex Network Generic Algorithm, CGA) for solving TSP problem, which is an variant of genetic algorithm. There are three differences between GA and CGA. First CGA does not use selection operator. Second, individuals of CGA interact with each other in specific environment determined by the complex network. Third, to some extent, the interaction of individuals in CGA is structured by the given complex network. Experimental results invalidate this new method on the one hand. On the other hand, they show that CGA is an effective algorithm.