Design of Competent Genetic Algorithms

  • David E. Goldberg
Part of the Genetic Algorithms and Evolutionary Computation book series (GENA, volume 7)


The good news of the last chapter was that mixing or exchange behavior can be understood in quantitative terms. The bad news was that simple selectorecombinative GAs scale poorly on hard problems, largely the result of their inadequate mixing behavior. of course, this does not say that simple GAs are not useful; nor does it invalidate the success that many have had in using simple GAs to solve problems that are difficult to approach by other means. Moreover, the class of nearly decomposable problems with unknown decomposition is difficult to crack by any computational method. But the results presented in the last chapter do go a long way toward explaining the observed fiddling and twiddling with codings and operators that have long been a staple of practical GA application. It also makes us wonder whether it is possible to design what we have called competent GAs—GAs that solve boundedly difficulty problems quickly, reliably, and accurately without the need for problemspecific codings, operators, or other forms of human intervention.


Building Block Linkage Group Probabilistic Expression Learn Classifier System Problem Difficulty 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • David E. Goldberg
    • 1
  1. 1.University of Illinois at Urbana-ChampaignUSA

Personalised recommendations