On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help

DOI10.1145/3299904.3340316zbMath1433.68646arXiv1907.12438OpenAlexW3106081651MaRDI QIDQ5215489

Per Kristian Lehre, Phan Trung Hai Nguyen

Publication date: 11 February 2020

Published in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.12438

zbMATH Keywords

epistasis deception running time analysis univariate marginal distribution algorithm deceptive leading blocks

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Bivariate estimation-of-distribution algorithms can find an exponential number of optima ⋮ Choosing the right algorithm with hints from complexity theory ⋮ An extended jump functions benchmark for the analysis of randomized search heuristics ⋮ A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes ⋮ The runtime of the compact genetic algorithm on jump functions ⋮ Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes ⋮ The univariate marginal distribution algorithm copes well with deception and epistasis

This page was built for publication: On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help