Real royal road functions for constant population size

DOI10.1016/j.tcs.2004.03.047zbMath1067.90128OpenAlexW2148770681MaRDI QIDQ596131

Ingo Wegener, Tobias Storch

Publication date: 10 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2003/5456

zbMATH Keywords

Genetic algorithmcrossoverEvolutionary algorithmOne-point crossoverPopulation sizeRoyal road functionRun time analysisUniform

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09) Randomized algorithms (68W20)

Related Items (8)

Black-box complexity: advantages of memory usage ⋮ A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions ⋮ Crossover can be constructive when computing unique input-output sequences ⋮ Crossover can provably be useful in evolutionary computation ⋮ Runtime analysis of the \((1+1)\) EA on computing unique input output sequences ⋮ Memetic algorithms outperform evolutionary algorithms in multimodal optimisation ⋮ Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change ⋮ Population size versus runtime of a simple evolutionary algorithm

Cites Work

• Real royal road functions -- where crossover provably is essential
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Real royal road functions for constant population size