Semantics based crossover for boolean problems

Nguven Quang Uy, Michael O'Neill, Nguyen Xuan Hoai, Bob McKay

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)

Abstract

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 wellknown 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.

Original languageEnglish
Title of host publicationProceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10
Pages869-872
Number of pages4
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010 - Portland, OR, United States
Duration: 7 Jul 201011 Jul 2010

Publication series

NameProceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Conference

Conference12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010
Country/TerritoryUnited States
CityPortland, OR
Period7/07/1011/07/10

Fingerprint

Dive into the research topics of 'Semantics based crossover for boolean problems'. Together they form a unique fingerprint.

Cite this