A study of permutation crossover operators on the traveling salesman problem
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Introduction to Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Elementary landscapes of frequency assignment problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Elementary bit string mutation landscapes
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Improving Lin-Kernighan-Helsgaun with crossover on clustered instances of the TSP
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
On using genetic algorithms for intrinsic side-channel resistance: the case of AES S-box
Proceedings of the First Workshop on Cryptography and Security in Computing Systems
Hi-index | 0.00 |
A new recombination operator is introduced for the Traveling Salesman Problem called partition crossover. Theoretical and empirical results indicate that when two local optima are recombined using partition crossover, two offspring are produced that are highly likely to also be local optima. Thus, the operator is capable of jumping or tunneling from two local optima to two new and distinct local optima without searching intermediate solutions. The operator is respectful and it transmits alleles which means that 1) all common edges from the two parents are inherited and 2) the offspring are constructed using only edges inherited from the two parents. Partition crossover is not always feasible: sometimes two new Hamiltonian circuits cannot be constructed by the operator using only edges inherited from the two parents. But empirical results indicate that partition crossover is feasible 95 percent of the time when recombining randomly selected local optima. Furthermore, from a sample of local optima that are within a short random walk of the global optimum, partition crossover typically relocates the global optimum in a single move when crossover is feasible.