On three new approaches to handle constraints within evolution strategies

DOI10.1007/s11047-006-0001-xzbMath1173.68825OpenAlexW2080422307MaRDI QIDQ862967

N. E. Zubov

Publication date: 25 January 2007

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-006-0001-x

zbMATH Keywords

evolutionary algorithmsevolution strategiessexual selectionnonlinear optimization problemconstraint-handling methodsfitness stagnationmetaevolutionminimum step size

Mathematics Subject Classification ID

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

Related Items (4)

Niching with derandomized evolution strategies in artificial and real-world landscapes ⋮ An accurate method for real-time aircraft dynamics simulation based on predictor-corrector scheme ⋮ A requirement for the mutation operator in continuous optimization ⋮ Solving Engineering Optimization Problems Without Penalty

Cites Work

• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
• An efficient constraint handling method for genetic algorithms
• Evolution strategies. A comprehensive introduction
• Unnamed Item
• Unnamed Item

This page was built for publication: On three new approaches to handle constraints within evolution strategies