Optimizing for change through shades

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Ryan, C., Collins, J. J., & Howard, D. (2011). Optimizing for change through shades. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6935 LNCS, pp. 266–273). https://doi.org/10.1007/978-3-642-24082-9_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free