When a genetic algorithm outperforms hill-climbing

DOI10.1016/J.TCS.2004.03.038zbMATH Open1067.90127OpenAlexW2054975983MaRDI QIDQ596132FDOQ596132

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

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

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)

Cites Work

• Title not available (Why is that?)
• Optimization by Simulated Annealing
• Title not available (Why is that?)
• Equation of State Calculations by Fast Computing Machines
• Hybrid evolutionary algorithms for graph coloring
• Statistical Dynamics of the Royal Road Genetic Algorithm
• Title not available (Why is that?)
• Determining computational complexity from characteristic ‘phase transitions’
• 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.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The mixing rate of different crossover operators
• The dynamics of a genetic algorithm for a simple learning problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• The dynamics of a genetic algorithm for simple random Ising systems

Cited In (13)

• Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
• Optimizing stimulus waveforms for electroceuticals
• Optimal parameters for search using a barrier tree Markov model
• Fast mutation in crossover-based algorithms
• An extended jump functions benchmark for the analysis of randomized search heuristics
• Sex versus asex: an analysis of the role of variance conversion
• Runtime analysis of quality diversity algorithms
• 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
• Stagnation detection meets fast mutation
• Stagnation detection meets fast mutation
• 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)