Analysis of recombinative algorithms on a non-separable building-block problem

MaRDI QIDQ2776407zbMATH OpenFDO

Authors R. A. Watson

Publication date 18 March 2002

zbMATH Keywords

building-block problem

Mathematics Subject Classification ID

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

Recommendations

• Just What Are Building Blocks?
• Scalability of selectorecombinative genetic algorithms for problems with tight linkage
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• On the analysis of evolutionary algorithms. -- A proof that crossover really can help
• Optimal recombination in genetic algorithms for combinatorial optimization problems. I

Cited in

(7)

• Real royal road functions -- where crossover provably is essential
• The one-dimensional Ising model: mutation versus recombination
• The use of explicit building blocks in evolutionary computation
• Scalability of selectorecombinative genetic algorithms for problems with tight linkage
• An analysis on recombination in multi-objective evolutionary optimization
• Diversity-preserving exploitation of crossover
• Effect of parent selection and sibling rivalry on building-block assembly

This page was built for publication: Analysis of recombinative algorithms on a non-separable building-block problem

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