Evolutionary programming using a mixed mutation strategy

DOI10.1016/J.INS.2006.07.014zbMath1142.68469OpenAlexW2079754109MaRDI QIDQ867619

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

global optimizationdesign of algorithmsevolutionary programmingrandomized algorithmsmixed strategy

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)

Related Items (10)

The effects of aspiration under multiple strategy updating rules on cooperation in prisoner's dilemma game ⋮ Average convergence rate of evolutionary algorithms in continuous optimization ⋮ 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 conditions for estimating the first hitting times of evolutionary algorithms ⋮ Drift analysis of mutation operations for biogeography-based optimization ⋮ Adaptive evolutionary programming based on reinforcement learning ⋮ A real-coded biogeography-based optimization with mutation ⋮ A comparative study of variation operators used for evolutionary multi-objective optimization ⋮ A mixed strategy of combining evolutionary algorithms with multigrid methods

Cites Work

• Generalized evolutionary programming with Lévy-type mutation
• Performance improvement of self-adaptive evolutionary methods with a dynamic lower bound
• A single-point mutation evolutionary programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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