Title :
Using the complex network for solving TSP problem
Author :
Yi-Ying Chen ; Ze-xing Zhang ; Wen-bin Li
Author_Institution :
Dept. of Inf. Eng., Shijiazhuang Univ. of Econ., Shijiazhuang, China
Abstract :
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.
Keywords :
complex networks; genetic algorithms; travelling salesman problems; CGA; TSP problem; complex network generic algorithm; genetic algorithm; selection operator; Gemerle algorithm; TSP; complex network;
Conference_Titel :
Computer Science and Network Technology (ICCSNT), 2012 2nd International Conference on
Conference_Location :
Changchun
Print_ISBN :
978-1-4673-2963-7
DOI :
10.1109/ICCSNT.2012.6526224