Do additional target points speed up evolutionary algorithms?

DOI10.1016/J.TCS.2023.113757MaRDI QIDQ2690877zbMATH OpenOpenAlexFDO

Authors Jakob Bossek, Dirk Sudholt

Publication date 17 March 2023

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

Full work available at URL https://doi.org/10.1016/j.tcs.2023.113757

zbMATH Keywords

evolutionary algorithmspseudo-Boolean functionsruntime analysis

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Do additional optima speed up evolutionary algorithms?
• scientific article; zbMATH DE number 1696516
• Population size versus runtime of a simple evolutionary algorithm
• On the analysis of the \((1+1)\) evolutionary algorithm
• Fixed-target runtime analysis

Cites work

• Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints
• Analyzing evolutionary algorithms. The computer science perspective.
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Black-box search by unbiased variation
• Design and analysis of migration in parallel evolutionary algorithms
• Do additional optima speed up evolutionary algorithms?
• Drift analysis and evolutionary algorithms revisited
• Exponential slowdown for larger populations. The (+1)-EA on monotone functions
• Fixed-target runtime analysis
• scientific article; zbMATH DE number 2107567 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 5686753 (Why is no real title available?)
• On the analysis of the \((1+1)\) evolutionary algorithm
• Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
• Population size versus runtime of a simple evolutionary algorithm
• Real royal road functions -- where crossover provably is essential
• Runtime analysis of a binary particle swarm optimizer
• Stagnation detection with randomized local search
• The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
• The impact of parametrization in memetic evolutionary algorithms
• The one-dimensional Ising model: mutation versus recombination
• Theory of evolutionary computation. Recent developments in discrete optimization
• Time complexity analysis of RLS and (1+1) EA for the edge coloring problem
• Towards a runtime comparison of natural and artificial evolution
• Upper and lower bounds for randomized search heuristics in black-box optimization

Cited in

(5)

• Do additional optima speed up evolutionary algorithms?
• Self-adjusting offspring population sizes outperform fixed parameters on the Cliff function
• A theoretical investigation of termination criteria for evolutionary algorithms
• Comma selection outperforms plus selection on OneMax with randomly planted optima
• Evolutionary anytime algorithms

This page was built for publication: Do additional target points speed up evolutionary algorithms?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2690877)