Rowe Jonathan E, Vose Michael D, Wright Alden H
School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK.
Evol Comput. 2002 Summer;10(2):151-84. doi: 10.1162/106365602320169839.
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 generalization of the term schema. Finally, it is sometimes possible for the group acting on omega to induce a group structure on omega itself.
假设有限搜索空间ω具有某些对称性，这些对称性可以用作用于它的一组置换来描述。如果交叉和变异尊重这些对称性，那么这些算子可以用一个混合矩阵和一组置换矩阵来描述。研究了ω的某些子集在交叉下不变的条件，从而导致了模式这一术语的推广。最后，作用于ω的群有时可能在ω自身上诱导出一个群结构。
