A solvable model of a hard optimisation problem

MaRDI QIDQ2751597zbMATH OpenFDO

Authors Alex Rogers, A. Prügel-Bennett

Publication date 21 October 2001

zbMATH Keywords

genetic algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1462668
• Modelling genetic algorithm dynamics
• Modeling and analysis of genetic algorithm with tournament selection
• Genetic algorithms in time-dependent environments
• The dynamics of a genetic algorithm for simple random Ising systems

Cited in

(8)

• GA performance distributions and randomly generated binary constraint satisfaction problems.
• The one-dimensional Ising model: mutation versus recombination
• Problem structure heuristics and scaling behavior for genetic algorithms
• Modeling and analysis of genetic algorithm with tournament selection
• Modelling genetic algorithm dynamics
• scientific article; zbMATH DE number 2040683 (Why is no real title available?)
• scientific article; zbMATH DE number 1462668 (Why is no real title available?)
• When a genetic algorithm outperforms hill-climbing

This page was built for publication: A solvable model of a hard optimisation problem

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