Adapting self-adaptive parameters in evolutionary algorithms

DOI10.1023/A:1011286929823MaRDI QIDQ5952116zbMATH OpenFDO

Authors Ko-Hsin Liang, Xin Yao, Charles Newton

Publication date 8 January 2002

Published in Applied Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1011286929823

zbMATH Keywords

evolutionary programming

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Performance improvement of self-adaptive evolutionary methods with a dynamic lower bound
• Evolutionary self-adaptation: a survey of operators and strategy parameters
• Self-adaptive heuristics for evolutionary computation
• Self-adaptation in fast evolutionary programming
• New Ways to Calibrate Evolutionary Algorithms

Cited in

(12)

• Auto-tuning strategy for evolutionary algorithms: Balancing between exploration and exploitation
• Performance improvement of self-adaptive evolutionary methods with a dynamic lower bound
• Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs
• Self-adaptation in fast evolutionary programming
• Towards a theory of practice in metaheuristics design: A machine learning perspective
• New Ways to Calibrate Evolutionary Algorithms
• A mixed strategy of combining evolutionary algorithms with multigrid methods
• scientific article; zbMATH DE number 1488083 (Why is no real title available?)
• scientific article; zbMATH DE number 2188490 (Why is no real title available?)
• Qualitative and quantitative assessment of step size adaptation rules
• Evolutionary self-adaptation: a survey of operators and strategy parameters
• A binary monkey search algorithm variation for solving the set covering problem

This page was built for publication: Adapting self-adaptive parameters in evolutionary algorithms

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