Dynamic parameter control in simple evolutionary algorithms

MaRDI QIDQ2776420zbMATH OpenFDO

Authors Stefan Droste, Thomas Jansen, Ingo Wegener

Publication date 28 February 2002

zbMATH Keywords

evolutionary algorithms

Mathematics Subject Classification ID

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

Recommendations

• On the analysis of a dynamic evolutionary algorithm
• scientific article; zbMATH DE number 1754585
• Evolutionary self-adaptation: a survey of operators and strategy parameters
• New Ways to Calibrate Evolutionary Algorithms
• scientific article; zbMATH DE number 2013506

Cited in

(12)

• How to analyse evolutionary algorithms.
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
• On the analysis of a dynamic evolutionary algorithm
• When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not
• New Ways to Calibrate Evolutionary Algorithms
• Parameter-less algorithm for evolutionary-based optimization: for continuous and combinatorial problems
• Using Self-Adaptable Probes for Dynamic Parameter Control of Parallel Evolutionary Algorithms
• Entropy-driven parameter control for evolutionary algorithms
• Runtime analysis of discrete particle swarm optimization applied to shortest paths computation
• Evolutionary self-adaptation: a survey of operators and strategy parameters
• Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
• Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem

This page was built for publication: Dynamic parameter control in simple evolutionary algorithms

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