Paper Info
Title
A new genetic approach for the traveling salesman problem
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
Year
DOI
Venue
1994
10.1109/ICEC.1994.350051
International Conference on Evolutionary Computation
Keywords
Field
DocType
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
Bottleneck traveling salesman problem,Graph theory,Crossover,Vertex (geometry),Computer science,Algorithm,Travelling salesman problem,2-opt,Genetic algorithm,Encoding (memory)
Conference
Citations 
PageRank 
References 
25
1.90
12
Authors
2
Name
Order
Citations
PageRank
Thang Nguyen Bui1769129.78
Byung Ro Moon236631.12