Theory of evolutionary algorithms: A bird's eye view

DOI10.1016/S0304-3975(99)00089-4zbMath0938.68142OpenAlexW2169905713WikidataQ127532703 ScholiaQ127532703MaRDI QIDQ1978365

Yanyan Li

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00089-4

zbMATH Keywords

convergenceevolutionary algorithmsdynamical behaviorrunning timeoperator analysisschemata

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (5)

Stability Analysis of DESA Optimization Algorithm ⋮ Drift analysis and average time complexity of evolutionary algorithms ⋮ Population size versus runtime of a simple evolutionary algorithm ⋮ Performance analysis of evolution strategies with multi-recombination in high-dimensional \(\mathbb R^N\)-search spaces disturbed by noise. ⋮ Towards an analytic framework for analysing the computation time of evolutionary algorithms

This page was built for publication: Theory of evolutionary algorithms: A bird's eye view