Crossover can be constructive when computing unique input-output sequences

DOI10.1007/s00500-010-0610-2zbMath1237.68189MaRDI QIDQ416273

Per Kristian Lehre, Xin Yao

Publication date: 10 May 2012

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-010-0610-2

zbMATH Keywords

evolutionary algorithms; crossover operator; finite state machines; runtime analysis; unique input-output sequences

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Hitting times of local and global optima in genetic algorithms with very high selection pressure, A study on the extended unique input/output sequence, Testing restorable systems: formal definition and heuristic solution based on river formation dynamics, Design and analysis of different alternating variable searches for search-based software testing, Tight bounds on the expected runtime of a standard steady state genetic algorithm, On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms, Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs, Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem

Cites Work

• Unnamed Item
• Unnamed Item
• Crossover can provably be useful in evolutionary computation
• Real royal road functions for constant population size
• On the analysis of the \((1+1)\) evolutionary algorithm
• A study of drift analysis for estimating computation time of evolutionary algorithms
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• The one-dimensional Ising model: mutation versus recombination
• Formal Approaches to Software Testing