Paper Info
Title
An Improved Genetic Algorithm Based On Gene Pool For Tsp
Abstract
Traveling salesman problem is a typical representative of combinatorial optimization problems. An improved Genetic algorithm is proposed for solving Traveling Salesman Problem (TSP). This Partheno-genetic algorithm employs only mutation and selection operators to produce the offspring, A new combinatory operator is designed combining the gene pool operator with inversion operator which ensures its strong searching capability. The gene pool directs the single-parent evolution and enhances the evolutionary speed. This algorithm simulates the recurrence of nature evolution process. Experiments based on 4 instances selected from TSPLIB are used to test the performance of this algorithm. They prove that it can reach the satisfying optimization at a faster speed. Especially, for the KroA100, the best path it finds is better than any other available one.
Year
DOI
Venue
2013
10.1007/978-3-319-09265-2_78
PERVASIVE COMPUTING AND THE NETWORKED WORLD
Keywords
Field
DocType
TSP, Gene pool, Combinatory operator, Partheno-genetic Algorithm
Gene pool,Mathematical optimization,Combinatorial optimization problem,Inversion (meteorology),Computer science,Travelling salesman problem,Operator (computer programming),Genetic algorithm,Distributed computing
Conference
Volume
ISSN
Citations 
8351
0302-9743
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Jianping Zhang100.34
Xiyu Liu200.68