一种线性表示的遗传程序设计方法研究

遗传程序设计领域中的一个重要研究内容是如何有效地表示进化的个体（计算机程序）,对采用树的线性后缀形式的个体进行位置信息编码以实现多种形式的遗传操作,并给出形式化定义,设计并实现了一个基于栈的遗传程序设计算法,通过模拟实验比较了各操作的性能,这种编码方式可以扩展到程序的线性结构中,以实现特定的遗传操作,显示出线性表示具有适于解决不同问题的可行性和灵活性,还给出了基于串的一点交叉的线性遗传程序设计的模式理论,它可以把标准遗传算法的模式生成机制统一到该理论框架中。

RESEARCH ON A GENETIC PROGRAMMING PARADIGM USING LINEAR REPRESENTATION

One of important subjects in the field of genetic programming (GP) is how to represent the evolutionary individuals (computer programs) efficiently. In this paper, the individuals with linear postfix forms of tree structures are encoded using position information to perform various genetic operators. The related formal definitions are given. A stack-based GP algorithm is designed and realized. The performance of the operations is examined using simulated experiments. The encoding manner can be extended to the linear structures of programs to implement specialized operators, which shows that the method possesses the feasibility and flexibility in dealing with different problems. The schema theory for linear GP with one-point crossover of string-based is also proposed, which may unify the schema creation mechanism of the standard GA into this theoretical frame.