When a genetic algorithm outperforms hill-climbing

DOI10.1016/j.tcs.2004.03.038zbMath1067.90127OpenAlexW2054975983MaRDI QIDQ596132

Adam Prügel-Bennett

Publication date: 10 August 2004

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

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

zbMATH Keywords

Genetic algorithmsSimulated annealingFirst-passage time

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09) Genetics and epigenetics (92D10)

Related Items (11)

Fast mutation in crossover-based algorithms ⋮ Sex versus asex: an analysis of the role of variance conversion ⋮ An evolutionary search technique to determine natural frequencies and mode shapes of composite Timoshenko beams ⋮ Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial ⋮ An extended jump functions benchmark for the analysis of randomized search heuristics ⋮ Memetic algorithms outperform evolutionary algorithms in multimodal optimisation ⋮ A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation ⋮ Optimal parameters for search using a barrier tree Markov model ⋮ Optimizing stimulus waveforms for electroceuticals ⋮ Stagnation detection meets fast mutation ⋮ Stagnation detection meets fast mutation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The dynamics of a genetic algorithm for simple random Ising systems
• Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
• Cumulant dynamics of a population under multiplicative selection, mutation, and drift.
• Finite populations induce metastability in evolutionary search.
• Hybrid evolutionary algorithms for graph coloring
• Statistical Dynamics of the Royal Road Genetic Algorithm
• The dynamics of a genetic algorithm for a simple learning problem
• Equation of State Calculations by Fast Computing Machines
• Determining computational complexity from characteristic ‘phase transitions’

This page was built for publication: When a genetic algorithm outperforms hill-climbing