Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
Authors:
- Duc-Cuong DangDDDuc-Cuong Dang
- Andre OprisAOAndre Opris
- Dirk SudholtDSDirk Sudholt
Open Access
- 26 February 2024
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 330
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Tight Bounds on the Expected Runtime of a Standard Steady State Genetic AlgorithmAlgorithmica, 2021
- Fixed-Parameter Tractability of Crossover: Steady-State GAs on the Closest String ProblemAlgorithmica, 2021
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problemArtificial Intelligence, 2019
- The ( $1+\lambda $ 1 + λ ) Evolutionary Algorithm with Self-Adjusting Mutation RateAlgorithmica, 2018
- Optimal Static and Self-Adjusting Parameter Choices for the $(1+(\lambda ,\lambda ))$ ( 1 + ( λ , λ ) ) Genetic AlgorithmAlgorithmica, 2017
- On Easiest Functions for Mutation Operators in Bio-Inspired OptimisationAlgorithmica, 2016
- An analysis on recombination in multi-objective evolutionary optimizationArtificial Intelligence, 2013
- Black-Box Search by Unbiased VariationAlgorithmica, 2012
- Simplified Drift Analysis for Proving Lower Bounds in Evolutionary ComputationAlgorithmica, 2010
- The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can HelpAlgorithmica, 2002