Elsevier

Information Processing Letters

Volume 56, Issue 5, 8 December 1995, Pages 281-292
Information Processing Letters

Abranching process model for genetic algorithms

https://doi.org/10.1016/0020-0190(95)00113-XGet rights and content

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.

References (29)

  • U.K. Chakraborty et al.

    Bit-string optimization in a brachytherapy dosimetry problem

  • U.K. Chakraborty et al.

    Optimization in the reliability problem: an inferential search approach

  • K.A. De Jong

    An analysis of the behavior of a class of genetic adaptive systems

  • W. Feller
  • Cited by (0)

    View full text