The analysis of evolutionary algorithms -- A proof that crossover really can help
From MaRDI portal
Publication:1849764
DOI10.1007/s00453-002-0940-2zbMath1016.68030OpenAlexW372717656MaRDI QIDQ1849764
Publication date: 1 December 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-002-0940-2
Related Items
A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions, Tight bounds on the expected runtime of a standard steady state genetic algorithm, Does comma selection help to cope with local optima?, Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem, Practical performance models of algorithms in evolutionary program induction and other domains, Running time analysis of ant colony optimization for shortest path problems, Crossover can be constructive when computing unique input-output sequences, Crossover can provably be useful in evolutionary computation, Lower bounds from fitness levels made easy, Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution, An extended jump functions benchmark for the analysis of randomized search heuristics, Runtime analysis for permutation-based evolutionary algorithms, The use of tail inequalities on the probable computational time of randomized search heuristics, How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys, On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms, Memetic algorithms outperform evolutionary algorithms in multimodal optimisation, A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation, An analysis on recombination in multi-objective evolutionary optimization, The runtime of the compact genetic algorithm on jump functions, How to escape local optima in black box optimisation: when non-elitism outperforms elitism, Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm, Performance analysis of randomised search heuristics operating with a fixed budget, Reducing the arity in unbiased black-box complexity, Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem, A Note on the Ring Loading Problem, Comparison of simple diversity mechanisms on plateau functions, Hitting times of local and global optima in genetic algorithms with very high selection pressure, The one-dimensional Ising model: mutation versus recombination
