Title
Neighborhood graphs and symmetric genetic operators
Abstract
In the case where the search space has a group structure, classical genetic operators (mutation and two-parent crossover) which respect the group action are completely characterized by formulas defining them in terms of the search space and its group operation. This provides a representation-free implementation for those operators, in the sense that the genotypic encoding of search space elements is irrelevant. The implementations are parameterized by distributions which may be chosen arbitrarily, and which are analogous to specifying distributions for mutation and crossover masks.
Year
DOI
Venue
2007
10.1007/978-3-540-73482-6_7
FOGA
Keywords
Field
DocType
symmetric genetic operator,classical genetic operator,group structure,group action,search space,crossover mask,group operation,genotypic encoding,two-parent crossover,representation-free implementation,neighborhood graph,search space element,genetic algorithm,genetic operator,transversality,transverse,generic property,fixed point
Discrete mathematics,Parameterized complexity,Mathematical optimization,Combinatorics,Crossover,Generic property,Operator (computer programming),Fixed point,Transversality,Genetic algorithm,Mathematics,Encoding (memory)
Conference
ISBN
Citations 
PageRank 
978-3-540-73479-6
4
0.54
References 
Authors
6
3
Name
Order
Citations
PageRank
Jonathan E. Rowe145856.35
Michael D. Vose2752215.67
Alden H. Wright333045.58