DocumentCode
2326362
Title
A new genetic approach for the traveling salesman problem
Author
Bui, Thang N. ; Moon, Byung R.
Author_Institution
Dept. of Comput. Sci., Pennsylvania State Univ., Middletown, PA, USA
fYear
1994
fDate
27-29 Jun 1994
Firstpage
7
Abstract
A new genetic algorithm (GA) for the traveling salesman problem (TSP) is given. Two novel features of this algorithm are: (i) a new locus-based encoding/crossover pair, and (ii) a static preprocessing step which changes the encoding order of the vertices. It is believed that this algorithm is also applicable to other ordering problems, not just TSP. Experimental results on the standard benchmarks for TSP are favorable
Keywords
encoding; genetic algorithms; graph theory; genetic algorithm; locus-based encoding/crossover pair; ordering problems; standard benchmarks; static preprocessing step; traveling salesman problem; vertex encoding order; Biological cells; Cities and towns; Computer science; Encoding; Erbium; Genetic algorithms; Moon; Scattering; Traveling salesman problems; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on
Conference_Location
Orlando, FL
Print_ISBN
0-7803-1899-4
Type
conf
DOI
10.1109/ICEC.1994.350051
Filename
350051
Link To Document