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
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Fitness Distance Correlation and Ridge Functions
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Redundant representations in evolutionary computation
Evolutionary Computation
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming
Evolutionary Computation
Representations for Genetic and Evolutionary Algorithms
Representations for Genetic and Evolutionary Algorithms
Towards understanding the effects of neutrality on the sudoku problem
Proceedings of the 9th annual conference on Genetic and evolutionary computation
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
The effects of constant neutrality on performance and problem hardness in GP
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Some steps towards understanding how neutrality affects evolutionary search
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
On the locality of grammatical evolution
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Acceleration of genetic algorithms for sudoku solution on many-core processors
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.01 |
We present an analysis of an application of Evolutionary Computation to the Sudoku Puzzle. In particular, we are interested in understanding the locality of the search operators employed, and the difficulty of the problem landscape. Treating the Sudoku puzzle as a permutation problem we analyse the locality of four permutation-based crossover operators, named One Cycle Crossover, Multi-Cycle Crossover, Partially Matched Crossover (PMX) and Uniform Swap Crossover. These were analysed using different crossover rates. Experimental evidence is found to support the hypothesis that PMX and Uniform Swap Crossover operators have better properties of locality relative to the other operators examined regardless of the crossover rates used. Fitness distance correlation, a well-known measure of hardness, is used to analyse problem difficulty and the results are consistent with the difficulty levels associated with the benchmark Sudoku puzzles analysed.