Article
Group properties of crossover and mutation.
Evolutionary computation - 1 Jan 2002
Rowe Jonathan E, Vose Michael D, Wright Alden H
Abstract excerpt
It is supposed that the finite search space omega has certain symmetries that can be described in terms of a group of permutations acting upon it. If crossover and mutation respect these symmetries, then these operators can be described in terms of a mixing matrix and a group of permutation matrices. Conditions under which certain subsets of omega are invariant under crossover are investigated, leading to a...
Read the complete abstract on PubMedTopics
Share this publication in a Topic to start or enrich a Post.
