Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
From MaRDI portal
Publication:6566616
DOI10.1016/J.ARTINT.2024.104098MaRDI QIDQ6566616
Andre Opris, Duc-Cuong Dang, Dirk Sudholt
Publication date: 3 July 2024
Published in: Artificial Intelligence (Search for Journal in Brave)
recombinationevolutionary computationruntime analysismulti-objective optimisationhypermutationunbiased black-box algorithms
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Crossover can provably be useful in evolutionary computation
- From black-box complexity to designing new genetic algorithms
- An analysis on recombination in multi-objective evolutionary optimization
- Real royal road functions for constant population size
- Analyzing different variants of immune inspired somatic contiguous hypermutations
- Simplified drift analysis for proving lower bounds in evolutionary computation
- Toward a unifying framework for evolutionary processes
- The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
- A study of drift analysis for estimating computation time of evolutionary algorithms
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- Black-box search by unbiased variation
- Optimal parameter choices via precise black-box analysis
- Tight bounds on the expected runtime of a standard steady state genetic algorithm
- Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
- On easiest functions for mutation operators in bio-inspired optimisation
- Real royal road functions -- where crossover provably is essential
- The one-dimensional Ising model: mutation versus recombination
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
- When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
- Black-box Complexity of Parallel Search with Distributed Populations
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Theory of Evolutionary Computation
- A runtime analysis of simple hyper-heuristics
This page was built for publication: Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566616)