Estimation of distribution algorithms on non-separable problems

DOI10.1080/00207160801968788zbMath1181.62177OpenAlexW2060274144MaRDI QIDQ5852154

Alexandru Agapie

Publication date: 26 January 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160801968788

zbMATH Keywords

order statisticevolutionary algorithmsstochastic convergence

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Analysis of algorithms and problem complexity (68Q25) Order statistics; empirical distribution functions (62G30) Approximation methods and heuristics in mathematical programming (90C59) Genetics and epigenetics (92D10) Randomized algorithms (68W20)

Related Items (2)

Theoretical analysis of steady state genetic algorithms ⋮ Evolutionary algorithms for continuous-space optimisation

Cites Work

• The dynamics of a genetic algorithm for simple random Ising systems
• Towards an analytic framework for analysing the computation time of evolutionary algorithms
• On the analysis of the \((1+1)\) evolutionary algorithm
• Learning probability distributions in continuous evolutionary algorithms -- a comparative review
• Transition functions for evolutionary algorithms on continuous state-space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Estimation of distribution algorithms on non-separable problems