Comparing evolutionary algorithms to the (\(1+1\))-EA

DOI10.1016/j.tcs.2008.03.008zbMath1155.68073OpenAlexW1971660317MaRDI QIDQ2518374

Anton Valentinovich Eremeev, Pavel Borisovsky

Publication date: 15 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.008

zbMATH Keywords

optimizationcomparisonmonotonicitydominationevolutionary algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

The impact of random initialization on the runtime of randomized search heuristics ⋮ The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Finding minimum label spanning trees using cross‐entropy method ⋮ Comparing evolutionary algorithms to the (\(1+1\))-EA ⋮ Runtime analysis of ant colony optimization with best-so-far reinforcement ⋮ On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem

Cites Work

• Optimization by Simulated Annealing
• A genetic algorithm for the set covering problem
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• How to analyse evolutionary algorithms.
• Performance analysis of evolution strategies with multi-recombination in high-dimensional \(\mathbb R^N\)-search spaces disturbed by noise.
• Comparison of certain evolutionary algorithms
• Comparing evolutionary algorithms to the (\(1+1\))-EA
• Stochastically monotone Markov Chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparing evolutionary algorithms to the (\(1+1\))-EA