Theoretical And Empirical Properties Of The Genetic Algorithm As A Numerical Optimizer

Christopher Jennison, Nuala Sheehan

Research output: Contribution to journalArticlepeer-review

Abstract

We investigate the basic form of the genetic algorithm as an optimization technique. Its failure to maximize a simple function of a string of 50 binary variables prompts a closer study of Holland’s “schema theorem” and we find the implications of this result to be much weaker than are often claimed. Further theoretical results and exact calculations for simple problems provide an understanding of how the genetic algorithm works and why it failed in our original application. We show that the algorithm can be fine tuned to succeed in that problem but only by introducing features that could cause serious difficulties in harder problems.

Original languageEnglish
Pages (from-to)296-318
Number of pages23
JournalJournal of Computational and Graphical Statistics
Volume4
Issue number4
DOIs
Publication statusPublished - Dec 1995

Keywords

  • Ergodic distribution
  • Global optimization
  • Markov chain
  • Schema theorem
  • Simulated annealing

ASJC Scopus subject areas

  • Statistics and Probability
  • Discrete Mathematics and Combinatorics
  • Statistics, Probability and Uncertainty

Cite this