Skip to main content
Article thumbnail
Location of Repository

Making and breaking power laws in evolutionary algorithm population dynamics

By Dr James M Whitacre, Dr Ruhul A Sarker and Dr Q. Tuan Pham

Abstract

Deepening our understanding of the characteristics and behaviors of population-based search algorithms remains an important ongoing challenge in Evolutionary Computation. To date however, most studies of Evolutionary Algorithms have only been able to take place within tightly restricted experimental conditions. For instance, many analytical methods can only be applied to canonical algorithmic forms or can only evaluate evolution over simple test functions. Analysis of EA behavior under more complex conditions is needed to broaden our understanding of this population-based search process. This paper presents an approach to analyzing EA behavior that can be applied to a diverse range of algorithm designs and environmental conditions. The approach is based on evaluating an individual’s impact on population dynamics using metrics derived from genealogical graphs.\ud From experiments conducted over a broad range of conditions, some important conclusions are drawn in this study. First, it is determined that very few individuals in an EA population have a significant influence on future population dynamics with the impact size fitting a power law distribution. The power law distribution indicates there is a non-negligible probability that single individuals will dominate the entire population, irrespective of population size. Two EA design features are however found to cause strong changes to this aspect of EA behavior: i) the population topology and ii) the introduction of completely new individuals. If the EA population topology has a long path length or if new (i.e. historically uncoupled) individuals are continually inserted into the population, then power law deviations are observed for large impact sizes. It is concluded that such EA designs can not be dominated by a small number of individuals and hence should theoretically be capable of exhibiting higher degrees of parallel search behavior

Topics: Artificial Intelligence
Publisher: Springer
Year: 2009
OAI identifier: oai:cogprints.org:6583
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://cogprints.org/6583/1/Ge... (external link)
  • http://cogprints.org/6583/ (external link)
  • Suggested articles

    Citations

    1. A Comparative Analysis of Selection Schemes Used in Genetic Algorithms,"
    2. (1997). Adaptive operator probabilities in a genetic algorithm that applies three operators,"
    3. (2003). An analysis of the behavior of simplified evolutionary algorithms on trap functions,"
    4. (2006). Credit assignment in adaptive evolutionary algorithms,"
    5. (1991). Handbook of Genetic Algorithms:
    6. (2003). Local evolvability of statistically neutral GasNet robot controllers,"
    7. (2001). Optimizing Epochal Evolutionary Search: PopulationSize Dependent Theory,"
    8. (2002). Selection Schemes in Evolutionary Algorithms,"
    9. (1996). Theory of Evolutionary Algorithms and Application to System Synthesis," Swiss Federal Institute of Technology,
    10. (1995). What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm,"

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.