The Univariate Marginal Distribution Algorithm Copes Well with Deception and Epistasis

In their recent work, Lehre and Nguyen (2019) show that the univariate marginal distribution algorithm (UMDA) needs time exponential in the parent populations size to optimize the DeceptiveLeadingBlocks (DLB) problem. They conclude from this result that univariate EDAs have difficulties with decepti...

Full description

Saved in:
Bibliographic Details
Published in:Evolutionary computation Vol. 29; no. 4; p. 543
Main Authors: Doerr, Benjamin, Krejca, Martin S
Format: Journal Article
Language:English
Published: United States 01.12.2021
Subjects:
ISSN:1530-9304, 1530-9304
Online Access:Get more information
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first