Logo image
Back
On the mean convergence time of multi-parent genetic algorithms without selection
Conference paper   Peer reviewed

On the mean convergence time of multi-parent genetic algorithms without selection

Chuan-Kang Ting
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol.3630 LNAI, pp.403-412
2005
DOI: https://doi.org/10.1007/11553090_41

Abstract

Theoretical Computer Science Computer Science (all)
This paper investigates genetic drift in multi-parent genetic algorithms (MPGAs). An exact model based on Markov chains is proposed to formulate the variation of gene frequency. This model identifies the correlation between the adopted number of parents and the mean convergence time. Moreover, it reveals the pairwise equivalence phenomenon in the number of parents and indicates the acceleration of genetic drift in MPGAs. The good fit between theoretical and experimental results further verifies the capability of this model. © Springer-Verlag Berlin Heidelberg 2005.

Metrics

1 Record Views

Details

Logo image