Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark

The compact genetic algorithm (cGA) is one of the simplest estimation-of-distribution algorithms (EDAs). Next to the univariate marginal distribution algorithm (UMDA)- another simple EDA-, the cGA has been subject to extensive mathematical runtime analyses, often showcasing a similar or even superio...

Full description

Bibliographic Details

Published in:	IEEE transactions on evolutionary computation p. 1
Main Authors:	Chwialkowski, Marcel, Doerr, Benjamin, Krejca, Martin S.
Format:	Journal Article
Language:	English
Published:	IEEE 2025
Subjects:	Benchmark testing compact genetic algorithm Estimation-of-distribution algorithms Evolutionary computation Genetic algorithms Genetics LeadingOnes Lower bound Noise Optimization Probabilistic logic Runtime runtime analysis Upper bound
ISSN:	1089-778X, 1941-0026
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!