Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation

DOI10.1016/J.ARTINT.2024.104098MaRDI QIDQ6566616zbMATH OpenFDO

Authors Duc-Cuong Dang, Andre Opris, Dirk Sudholt

Publication date 3 July 2024

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2024.104098

zbMATH Keywords

evolutionary computationhypermutationmulti-objective optimisationrecombinationruntime analysisunbiased black-box algorithms

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Crossover can provably be useful in evolutionary computation
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• Real royal road functions -- where crossover provably is essential
• scientific article; zbMATH DE number 1405791
• An analysis on recombination in multi-objective evolutionary optimization

Cites work

• A runtime analysis of simple hyper-heuristics: to mix or not to mix operators
• A study of drift analysis for estimating computation time of evolutionary algorithms
• An analysis on recombination in multi-objective evolutionary optimization
• Analyzing different variants of immune inspired somatic contiguous hypermutations
• Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
• Black-box Complexity of Parallel Search with Distributed Populations
• Black-box search by unbiased variation
• Crossover can provably be useful in evolutionary computation
• Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
• Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
• Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
• From black-box complexity to designing new genetic algorithms
• scientific article; zbMATH DE number 2010446 (Why is no real title available?)
• scientific article; zbMATH DE number 2013466 (Why is no real title available?)
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
• On easiest functions for mutation operators in bio-inspired optimisation
• Optimal parameter choices via precise black-box analysis
• Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
• Real royal road functions -- where crossover provably is essential
• Real royal road functions for constant population size
• Simplified drift analysis for proving lower bounds in evolutionary computation
• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• The one-dimensional Ising model: mutation versus recombination
• Theory of evolutionary computation. Recent developments in discrete optimization
• Tight bounds on the expected runtime of a standard steady state genetic algorithm
• Toward a unifying framework for evolutionary processes
• When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not

Cited in

(3)

• Many-objective problems where crossover is provably essential
• Stochastic population update can provably be helpful in multi-objective evolutionary algorithms
• Why dominance is not enough: lessons from practical evolutionary multi-objective algorithms

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)