Bottom up approach for deriving the redundancy of Structured Genetic Algorithms

Angelos Molfetas

    Research output: Chapter in Book / Conference PaperConference Paper

    1 Citation (Scopus)

    Abstract

    This study examines how the redundancy of the structured genetic algorithm changes with the incorporation of control levels. Given that not all genes are activated in particular levels, the addition of control levels raises the number of redundant genes. The addition of control levels above one also increases the redundancy ratio, provided the number of genes in the top level remains fixed. The redundancy ratio, however, is not guaranteed to raise with each control level above one if the number of bottom level genes is held constant, instead of assuming a fixed number of top level genes. These are significant findings as there are strong indicators that redundancy may be correlated to algorithmic performance.
    Original languageEnglish
    Title of host publicationIEEE Congress on Evolutionary Computation, 2006: CEC 2006
    PublisherIEEE
    Number of pages7
    ISBN (Print)0780394879
    Publication statusPublished - 2006
    EventCongress on Evolutionary Computation -
    Duration: 18 Jul 2010 → …

    Conference

    ConferenceCongress on Evolutionary Computation
    Period18/07/10 → …

    Keywords

    • bottom level genes
    • genetic algorithms
    • redundancy
    • structured genetic algorithms

    Fingerprint

    Dive into the research topics of 'Bottom up approach for deriving the redundancy of Structured Genetic Algorithms'. Together they form a unique fingerprint.

    Cite this