Embedded cartesian genetic programming and the lawnmower and hierarchical-if-and-only-if problems
Embedded cartesian genetic programming and the lawnmower and hierarchical-if-and-only-if problems
复制标题
嵌入式笛卡尔遗传编程和割草机以及分层当且仅当问题
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
J. Miller
中科院分区：
文献类型：
--
作者：
James Alfred Walker;J. Miller
嵌入式笛卡尔遗传编程(ECGP)是基于有向图的笛卡尔遗传编程(CGP)的扩展，它能够以模块的形式自动获取、进化和重用部分解。在这篇文章中，我们首次将CGP和ECGP应用于著名的Lawnmower问题和分层充要条件问题。后者通常与遗传算法有关。计算工作量图是由CGP和ECGP的结果计算的，我们的结果与其他方法相比是有利的。
Embedded Cartesian Genetic Programming (ECGP) is an extension of the directed graph based Cartesian Genetic Programming (CGP), which is capable of automatically acquiring, evolving and re-using partial solutions in the form of modules. In this paper, we apply for the first time, CGP and ECGP to the well known Lawnmower problem and to the Hierarchical-if-and-Only-if problem. The latter is normally associated with Genetic Algorithms. Computational effort figures are calculated from the results of both CGP and ECGP and our results compare favourably with other techniques.