Evolutionary programming using a mixed mutation strategy

DOI10.1016/J.INS.2006.07.014MaRDI QIDQ867619zbMATH OpenOpenAlexFDO

Authors Jun He, Houkuan Huang, Wei Hou, Hong-Bin Dong

Publication date 16 February 2007

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2006.07.014

zbMATH Keywords

design of algorithmsevolutionary programmingglobal optimizationmixed strategyrandomized algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Recommendations

• On mutation operators of evolutionary programming and evolution strategies
• Evolutionary programming based on non-uniform mutation
• Cooperative mutation based evolutionary programming for continuous function optimization
• Pure strategy or mixed strategy? An initial comparison of their asymptotic convergence rate and asymptotic hitting time
• Adaptive evolutionary programming based on reinforcement learning

Cites work

• A single-point mutation evolutionary programming
• Generalized evolutionary programming with Lévy-type mutation
• scientific article; zbMATH DE number 3705806 (Why is no real title available?)
• scientific article; zbMATH DE number 1179499 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 903638 (Why is no real title available?)
• scientific article; zbMATH DE number 3240118 (Why is no real title available?)
• Performance improvement of self-adaptive evolutionary methods with a dynamic lower bound

Cited in

(18)

• An evolutionary programming approach to mixed-variable optimization problems
• A single-point mutation evolutionary programming
• Adaptive evolutionary programming based on reinforcement learning
• The effects of aspiration under multiple strategy updating rules on cooperation in prisoner's dilemma game
• Pure strategy or mixed strategy? An initial comparison of their asymptotic convergence rate and asymptotic hitting time
• A mixed strategy of combining evolutionary algorithms with multigrid methods
• Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions
• Improving performance of evolutionary algorithms with application to fuzzy control of truck backer-upper system
• Drift analysis of mutation operations for biogeography-based optimization
• On mutation operators of evolutionary programming and evolution strategies
• Drift conditions for estimating the first hitting times of evolutionary algorithms
• Average convergence rate of evolutionary algorithms in continuous optimization
• Optimal placement of sensors for controlling smart base isolation systems
• Generalized evolutionary programming with Lévy-type mutation
• A comparative study of variation operators used for evolutionary multi-objective optimization
• A single component mutation evolutionary programming
• A real-coded biogeography-based optimization with mutation
• Evolutionary programming based on non-uniform mutation

This page was built for publication: Evolutionary programming using a mixed mutation strategy

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