Do additional target points speed up evolutionary algorithms?
From MaRDI portal
Publication:2690877
DOI10.1016/j.tcs.2023.113757OpenAlexW4319312717MaRDI QIDQ2690877
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
Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Analyzing evolutionary algorithms. The computer science perspective.
- Design and analysis of migration in parallel evolutionary algorithms
- Runtime analysis of a binary particle swarm optimizer
- The impact of parametrization in memetic evolutionary algorithms
- On the analysis of the \((1+1)\) evolutionary algorithm
- Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
- Black-box search by unbiased variation
- Fixed-target runtime analysis
- Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints
- Stagnation detection with randomized local search
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
- Towards a runtime comparison of natural and artificial evolution
- Real royal road functions -- where crossover provably is essential
- Upper and lower bounds for randomized search heuristics in black-box optimization
- Population size versus runtime of a simple evolutionary algorithm
- The one-dimensional Ising model: mutation versus recombination
- Drift Analysis and Evolutionary Algorithms Revisited
- Do additional optima speed up evolutionary algorithms?
- Exponential slowdown for larger populations
- Time complexity analysis of RLS and (1 + 1) EA for the edge coloring problem
- Theory of Evolutionary Computation
This page was built for publication: Do additional target points speed up evolutionary algorithms?
