Towards a runtime comparison of natural and artificial evolution

DOI10.1007/s00453-016-0212-1zbMath1366.68270arXiv1504.06260OpenAlexW2521372821WikidataQ59607240 ScholiaQ59607240MaRDI QIDQ2362364

Dirk Sudholt, Barbora Trubenová, Tiago Paixão, Jorge Pérez Heredia

Publication date: 7 July 2017

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

population geneticsevolutionary algorithmstheoryruntime analysisstrong selection weak mutation regimenatural evolution

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problems related to evolution (92D15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (13)

Towards a runtime comparison of natural and artificial evolution ⋮ Does comma selection help to cope with local optima? ⋮ Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial ⋮ When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms ⋮ When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter ⋮ An extended jump functions benchmark for the analysis of randomized search heuristics ⋮ Do additional target points speed up evolutionary algorithms? ⋮ Memetic algorithms outperform evolutionary algorithms in multimodal optimisation ⋮ Exponential upper bounds for the runtime of randomized search heuristics ⋮ On the analysis of trajectory-based search algorithms: when is it beneficial to reject improvements? ⋮ How to escape local optima in black box optimisation: when non-elitism outperforms elitism

Cites Work

• Unnamed Item
• Unnamed Item
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• Simplified drift analysis for proving lower bounds in evolutionary computation
• Toward a unifying framework for evolutionary processes
• Evolutionary algorithms and matroid optimization problems
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Runtime analysis of a simple ant colony optimization algorithm
• Mathematical population genetics. I: Theoretical introduction.
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• A simple ant colony optimizer for stochastic shortest path problems
• Black-box search by unbiased variation
• The fastest evolutionary trajectory
• On the runtime analysis of the simple genetic algorithm
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
• Towards a runtime comparison of natural and artificial evolution
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
• Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
• Population size versus runtime of a simple evolutionary algorithm
• Algorithms, games, and evolution
• STACS 2005
• Evolvability
• Introduction to evolutionary computing

This page was built for publication: Towards a runtime comparison of natural and artificial evolution