Please use this identifier to cite or link to this item:
|Title:||On the design of diploid genetic algorithms for problem optimization in dynamic environments|
|Citation:||IEEE Congress on Evolutionary Computation (CEC 2006), Vancouver, BC: 1362 - 1369, Sep 2006|
|Abstract:||Using diploidy and dominance is one method to enhance the performance of genetic algorithms in dynamic environments. For diploidy genetic algorithms, there are two key design factors: the cardinality of genotypic alleles and the uncertainty in the dominance scheme. This paper investigates the effect of these two factors on the performance of diploidy genetic algorithms in dynamic environments. A generalized diploidy and dominance scheme is proposed for diploidy genetic algorithms, where the cardinality of genotypic alleles and/or the uncertainty in the dominance scheme can be easily tuned and studied. The experimental results show the efficiency of increasing genotypic cardinality rather than introducing uncertainty in the dominance scheme.|
|Description:||Tihis article is posted here with permission from the IEEE - Copyright @ 2006 IEEE|
|Appears in Collections:||Publications|
Dept of Computer Science Research Papers
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.