Return to search

Adaptation and self-organization in evolutionary algorithms

The objective of Evolutionary Computation is to solve practical problems (e.g.optimization, data mining) by simulating the mechanisms of natural evolution. This thesis addresses several topics related to adaptation and self-organization in evolving systems with the overall aims of improving the performance of Evolutionary Algorithms (EA), understanding its relation to natural evolution, and incorporating new mechanisms for mimicking complex biological systems. Part I of this thesis presents a new mechanism for allowing an EA to adapt its behavior in response to changes in the environment. Using the new approach, adaptation of EA behavior (i.e. control of EA design parameters) is driven by an analysis of population dynamics, as opposed to the more traditional use of fitness measurements. Comparisons with a number of adaptive control methods from the literature indicate substantial improvements in algorithm performance for a range of artificial and engineering design problems. Part II of this thesis involves a more thorough analysis of EA behavior based on the methods derived in Part 1. In particular, several properties of EA population dynamics are measured and compared with observations of evolutionary dynamics in nature. The results demonstrate that some large scale spatial and temporal features of EA dynamics are remarkably similar to their natural counterpart. Compatibility of EA with the Theory of Self-Organized Criticality is also discussed. Part III proposes fundamentally new directions in EA research which are inspired by the conclusions drawn in Part II. These changes involve new mechanisms which allow selforganization of the EA to occur in ways which extend beyond its common convergence in parameter space. In particular, network models for EA populations are developed where the network structure is dynamically coupled to EA population dynamics. Results indicate strong improvements in algorithm performance compared to cellular Genetic Algorithms and non-distributed EA designs. Furthermore, topological analysis indicates that the population network can spontaneously evolve to display similar characteristics to the interaction networks of complex biological systems.

Identiferoai:union.ndltd.org:ADTP/258274
Date January 2007
CreatorsWhitacre, James M., Chemical Sciences & Engineering, Faculty of Engineering, UNSW
PublisherAwarded by:University of New South Wales. Chemical Sciences & Engineering
Source SetsAustraliasian Digital Theses Program
LanguageEnglish
Detected LanguageEnglish
RightsCopyright Whitacre James M.., http://unsworks.unsw.edu.au/copyright

Page generated in 0.0016 seconds