A Branching Process Model for Genetic Algorithms

Research output: Contribution to journalArticlepeer-review

Abstract

A new stochastic analysis of schema processing in genetic algorithms is presented in this paper. We have developed a branching process model for the haploid, binary, fixed-length genetic algorithm with fitness-proportionate selection, single-point crossover and bitwise mutation. We provide empirical evidence on a ten-problem test suite.
Original languageAmerican English
JournalInformation Processing Letters
Volume56
DOIs
StatePublished - Dec 8 1995
Externally publishedYes

Disciplines

  • Mathematics
  • Theory and Algorithms
  • Discrete Mathematics and Combinatorics
  • Artificial Intelligence and Robotics

Cite this