Optimizing for change through shades

Conor Ryan, J. J. Collins, Daniel Howard

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

Abstract

The reliance of Evolutionary Algorithms on haploid genotypes has proved a difficult area for non-stationary function optimization. While it is generally accepted that various approaches involving diploidy can better cope with these kinds of problems, none of these paradigms have gained wide acceptance in the GA community. We describe Shades, a new haploid system which uses Polygenic Inheritance. Polygenic inheritance differs from most implementations of GAs in that several genes contribute to each phenotypic trait. A Knapsack non-stationary function optimization problems from the literature is described, and it is shown how Shades outperforms diploidy for this task.

Original languageEnglish
Title of host publicationConvergence and Hybrid Information Technology - 5th International Conference, ICHIT 2011, Proceedings
Pages266-273
Number of pages8
DOIs
Publication statusPublished - 2011
Event5th International Conference on Convergence and Hybrid Information Technology, ICHIT 2011 - Daejeon, Korea, Republic of
Duration: 22 Sep 201124 Sep 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6935 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Convergence and Hybrid Information Technology, ICHIT 2011
Country/TerritoryKorea, Republic of
CityDaejeon
Period22/09/1124/09/11

Keywords

  • Diploidy
  • Dynamic Environments
  • Polygenic Inheritance

Fingerprint

Dive into the research topics of 'Optimizing for change through shades'. Together they form a unique fingerprint.

Cite this