The Community for Technology Leaders
Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
ISBN: 978-0-7695-3507-4
pp: 795-799
The TSP (Traveling Salesman Problem) genetic algorithm is very possible of destroying ever found pieces of a path. To prevent the found pieces from being destroyed, a P2P based TSP genetic algorithm P2PTSPGA which make use of gene clusters is presented. The gene cluster which stands for a series of cities is past down in whole to the offspring from their parent individuals, and is smashed after the first optimum is found to prevent the algorithm from falling into a local optimum. Experiments on CHN144 and instances of TSPLIB show that the optimal solutions are the same as the published results, except the solution 3859 for TSP225 is better than the result 3916 published up-to-date. Our experiments also show that the P2PTSPGA has a high performance in solving such TSPs that number of cities is less than 5000.
Traveling Salesman Problem, Gene Cluster, Peer to Peer, Genetic Algorithm

Z. Wei, L. Yansheng, S. Enmin and M. Guangzhi, "Introducing Gene Clusters into a P2P Based TSP Solving Algorithm," 2009 WRI World Congress on Computer Science and Information Engineering, CSIE(CSIE), Los Angeles, CA, 2009, pp. 795-799.
82 ms
(Ver 3.3 (11022016))