University of Leicester
Browse
getPDF.pdf (275.54 kB)

On the Design of Diploid Genetic Algorithms for Problem Optimization in Dynamic Environments

Download (275.54 kB)
conference contribution
posted on 2008-11-14, 10:02 authored by Shengxiang Yang
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.

History

Citation

2006 IEEE Congress on Evolutionary Computation, Proceedings of, pp. 1362-1369

Published in

2006 IEEE Congress on Evolutionary Computation

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

isbn

0780394879

Copyright date

2006

Available date

2008-11-14

Publisher version

http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1688467

Language

en

Usage metrics

    University of Leicester Publications

    Categories

    No categories selected

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC