When a genetic algorithm outperforms hill-climbing

DOI10.1016/J.TCS.2004.03.038MaRDI QIDQ596132zbMATHOpenAlexFDO

Authors A. 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 algorithmsFirst-passage timeSimulated annealing

Mathematics Subject Classification ID

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

Recommendations

• Publication:4486977
• scientific article; zbMATH DE number 912620
• Global optimization performance measures for generalized hill climbing algorithms
• Explaining optimization in genetic algorithms with uniform crossover
• A new genetic algorithm

Cites work

• scientific article; zbMATH DE number 1664950 (Why is no real title available?)
• scientific article; zbMATH DE number 1664955 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1462668 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 1405791 (Why is no real title available?)
• Cumulant dynamics of a population under multiplicative selection, mutation, and drift.
• Determining computational complexity from characteristic ``phase transitions
• Equation of state calculations by fast computing machines
• Finite population effects for ranking and tournament selection
• Finite populations induce metastability in evolutionary search.
• Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
• Hybrid evolutionary algorithms for graph coloring
• Optimization by simulated annealing
• Statistical Dynamics of the Royal Road Genetic Algorithm
• The dynamics of a genetic algorithm for a simple learning problem
• The dynamics of a genetic algorithm for simple random Ising systems
• The mixing rate of different crossover operators

Cited in

(15)

• Runtime analysis of quality diversity algorithms
• Fast mutation in crossover-based algorithms
• Optimizing stimulus waveforms for electroceuticals
• An extended jump functions benchmark for the analysis of randomized search heuristics
• Explaining optimization in genetic algorithms with uniform crossover
• The combined use of a genetic algorithm and the hill-climbing algorithm to find difference triangle sets
• An evolutionary search technique to determine natural frequencies and mode shapes of composite Timoshenko beams
• Optimal parameters for search using a barrier tree Markov model
• Sex versus asex: an analysis of the role of variance conversion
• Stagnation detection meets fast mutation
• Stagnation detection meets fast mutation
• GAHC: Hybrid Genetic Algorithm
• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
• Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial

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

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