Evolution and Acquisition of Modules in Cartesian Genetic Programming
Evolution and Acquisition of Modules in Cartesian Genetic Programming
复制标题
笛卡尔遗传规划中模块的演化和获取
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
J. Miller
中科院分区：
文献类型：
--
作者：
James Alfred Walker;J. Miller
本文首次提出了基于图的笛卡尔遗传规划方法中模块的自动获取和进化。在一组偶宇称问题上对该方法进行了检验，并与无模块的笛卡尔遗传规划进行了比较。结果表明，新的模块化方法的求解速度比原来的非模块化方法快20倍，并且在更大的问题上加速更加明显。对一些演化模的分析表明，它们通常是低阶奇偶函数。对该方法的进一步改进进行了展望。
The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of even parity problems and compared with Cartesian Genetic Programming without modules. Results are given that show that the new modular method evolves solutions up to 20 times quicker than the original non-modular method and that the speedup is more pronounced on larger problems. Analysis of some of the evolved modules shows that often they are lower order parity functions. Prospects for further improvement of the method are discussed.