Show simple item record

dc.contributor.authorYoon, Yourim
dc.contributor.authorKim, Yong-Hyuk
dc.contributor.authorMoraglio, Alberto
dc.contributor.authorMoon, Byung-Ro
dc.date.accessioned2013-09-23T14:44:18Z
dc.date.issued2011-08-12
dc.description.abstractWe extend a geometric framework for the interpretation of search operators to encompass the genotype–phenotype mapping derived from an equivalence relation defined by an isometry group. We show that this mapping can be naturally interpreted using the concept of quotient space, in which the original space corresponds to the genotype space and the quotient space corresponds to the phenotype space. Using this characterization, it is possible to define induced geometric crossovers on the phenotype space (called quotient geometric crossovers). These crossovers have very appealing properties for non-synonymously redundant encodings, such as reducing the size of the search space actually searched, removing the low locality from the encodings, and allowing a more informed search by utilizing distances better tailored to the specific solution interpretation. Interestingly, quotient geometric crossovers act on genotypes but have an effect equivalent to geometric crossovers acting directly on the phenotype space. This property allows us to actually implement them even when phenotypes cannot be represented directly. We give four example applications of quotient geometric crossovers for non-synonymously redundant encodings and demonstrate their superiority experimentally.en_GB
dc.identifier.citationVol. 425, pp. 4 - 16en_GB
dc.identifier.doi10.1016/j.tcs.2011.08.015
dc.identifier.urihttp://hdl.handle.net/10871/13626
dc.language.isoenen_GB
dc.publisherElsevieren_GB
dc.subjectGenotype–phenotype mappingen_GB
dc.subjectRedundant representationen_GB
dc.subjectQuotient metric spaceen_GB
dc.subjectGeometric crossoveren_GB
dc.subjectQuotient geometric crossoveren_GB
dc.titleQuotient geometric crossovers and redundant encodingsen_GB
dc.typeArticleen_GB
dc.date.available2013-09-23T14:44:18Z
dc.identifier.issn0304-3975
dc.descriptionCopyright © 2012 Elsevier. NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Computer Science Vol. 425 (2012), DOI: 10.1016/j.tcs.2011.08.015en_GB
dc.identifier.journalTheoretical Computer Scienceen_GB


Files in this item

This item appears in the following Collection(s)

Show simple item record