Scalability problems of simple genetic algorithms

  • Authors:

  • Dirk Thierens

  • Affiliations:

  • Department of Computer Science Utrecht University P.O. Box 80089 3508 TB Utrecht, The Netherlands dirk.thierens@cs.uu.nl

  • Venue:
  • Evolutionary Computation
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Scalable evolutionary computation has. become an intensively studied research topic in recent years. The issue of scalability is predominant in any field of algorithmic design, but it became particularly relevant for the design of competent genetic algorithms once the scalability problems of simple genetic algorithms were understood. Here we present some of the work that has aided in getting a clear insight in the scalability problems of simple genetic algorithms. Particularly, we discuss the important issue of building block mixing. We show how the need for mixing places a boundary in the GA parameter space that, together with the boundary from the schema theorem, delimits the region where the GA converges reliably to the optimum in problems of bounded difficulty. This region shrinks rapidly with increasing problem size unless the building blocks are tightly linked in the problem coding structure. In addition, we look at how straightforward extensions of the simple genetic algorithm---namely elitism, niching, and restricted mating are not significantly improving the scalability problems.