摘要
图式定理是遗传算法的基本定理，它给出在选择、交换、变异算子的作用下，遗传算法的某一图式经过一步迭代后在下一代存在的数目的下界。本文将这一定理进行推广，给出了具有倒位算子的图式定理的表达式．并论证了引入倒位算子的必要性。
The schema theorem is the fundamental theorem of genetic algorithm. It provides a lower bound on the expected number of representatives of a particular schema in the next generation under selection. crossover and mutation. This paper analyses the necessity of inversion and gives the expression of lower bound on the expected number of a particular schema in the next generation under the action of selection, crossover. mutation and inversion operators.
出处
《系统工程与电子技术》
EI
CSCD
1996年第10期45-49,共5页
Systems Engineering and Electronics
基金
国家自然科学基金
博士后基金
