Real royal road functions for constant population size

DOI10.1016/J.TCS.2004.03.047zbMATH Open1067.90128OpenAlexW2148770681MaRDI QIDQ596131FDOQ596131

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

crossoverGenetic algorithmEvolutionary 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) Randomized algorithms (68W20) Boolean programming (90C09)

Cites Work

• Real royal road functions -- where crossover provably is essential
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596131)