title: Representation invariant genetic operators.
abstract: A genetic algorithm is invariant with respect to a set of representations if it runs the same no matter which of the representations is used. We formalize this concept mathematically, showing that the representations generate a group that acts upon the search space. Invariant genetic operators are those that commute with this group action. We then consider the problem of characterizing crossover and mutation operators that have such invariance properties. In the case where the corresponding group action acts transitively on the search space, we provide a complete characterization, including high-level representation-independent algorithms implementing these operators.
authors.affiliation: School of Computer Science, University of Birmingham, Birmingham, B15 2TT, UK. J.E.Rowe@cs.bham.ac.uk
authors.forename: Jonathan E
authors.initials: JE
authors.lastname: Rowe
authors.forename: Michael D
authors.initials: MD
authors.lastname: Vose
authors.forename: Alden H
authors.initials: AH
authors.lastname: Wright
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D008957:Models, Genetic; D057386:Search Engine