The natural crossover for the 2D Euclidean TSP

摘要: For the traveling salesman problem various search algorithms have been suggested for decades. In field of genetic algorithms, many operators introduced problem. Most encoding schemes some restrictions that cause more-or-less loss information contained in instances. We suggest a new encoding/crossover pair which pursues minimal chromosomal and restriction recombination 2D Euclidean The most notable feature crossover is it based on totally concept encoding. also prove theoretical validity by an equivalence-class analysis. proposed outperformed both distance-preserving edge-assembly crossover, two state-of-the-art crossovers literature.