Article thumbnail

Transmission function models of finite population genetic algorithms

By C.H.M. Kemenade, Joost Kok, Han La PoutrĂ© and Dirk Thierens


textabstractInfinite population models show a deterministic behaviour. Genetic algorithms with finite populations behave non-deterministicly. For small population sizes, the results obtained with these models differ strongly from the results predicted by the infinite population model. When the population size is increased towards infinity, a convergence to the results predicted by the infinite population models is observed. In real GA's random decisions are used during the run of the GA. These random decisions can lead to a behaviour that results in a deviation of the GA from the expected path of evolution. In this report four sources of non-determinism are identified. Finite population models are generated by explicitly modelling two of these sources. When comparing the results to runs of actual genetic algorithms, similar results are obtained. Hence, this model shows what are the most important sources of non-determinism in the GA for the problem at hand

Publisher: CWI
Year: 1998
OAI identifier:
Provided by: NARCIS
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • (external link)
  • (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles