Semantics based crossover for boolean problems
Semantics based crossover for boolean problems
复制标题
基于语义的布尔问题交叉
DOI：
10.1145/1830483.1830642
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
R. McKay
中科院分区：
文献类型：
--
作者：
Nguyen Quang Uy;N. X. Hoai;M. O’Neill;R. McKay
本文研究了交叉算子的语义多样性和局部性。布尔问题的遗传规划。提出了利用Trace语义测量和存储布尔域子树语义的方法，并在此基础上设计了几种新的交叉算法。它们可以根据其目的分为两类：促进语义多样性或改善语义局部性。我们在几个著名的布尔问题上测试了这些算子，并将它们与标准GP交叉和Beadle和Johnson的语义驱动交叉进行了比较。实验结果表明，交叉算子在提高语义多样性和提高语义局部性方面都有积极的效果。他们还表明，后者比前者对GP绩效有更大的积极影响。
This paper investigates the role of semantic diversity and locality of crossover operators in. Genetic Programming (GP) for Boolean problems. We propose methods for measuring and storing semantics of subtrees in Boolean domains using Trace Semantics, and design several new crossovers on this basis. They can be categorised into two classes depending on their purposes: promoting semantic diversity or improving semantic locality. We test the operators on several well-known Boolean problems, comparing them with Standard GP Crossovers and with the Semantic Driven Crossover of Beadle and Johnson. The experimental results show the positive effects both of promoting semantic diversity, and of improving semantic locality, in crossover operators. They also show that the latter has a greater positive effect on GP performance than the former.
DOI：
--
发表时间：
1992
期刊：
--
影响因子：
--
作者：
J. Koza
通讯作者：
J. Koza