Sex and death: towards biologically inspired heuristics for constraint handling
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Performance analysis of niching algorithms based on derandomized-ES variants
Proceedings of the 9th annual conference on Genetic and evolutionary computation
On the Behaviour of the (1+1)-ES for a Simple Constrained Problem
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Premature Convergence in Constrained Continuous Search Spaces
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Niching with derandomized evolution strategies in artificial and real-world landscapes
Natural Computing: an international journal
Simulated evolution under multiple criteria conditions revisited
WCCI'08 Proceedings of the 2008 IEEE world conference on Computational intelligence: research frontiers
A review of constraint-handling techniques for evolution strategies
Applied Computational Intelligence and Soft Computing - Special issue on theory and applications of evolutionary computation
On the behaviour of the (1,λ)-es for a simple constrained problem
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Analysis of a repair mechanism for the (1,λ)-ES applied to a simple constrained problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A (1+1)-CMA-ES for constrained optimisation
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Solving dynamic constraint optimization problems using ICHEA
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Resampling versus repair in evolution strategies applied to a constrained linear problem
Evolutionary Computation
An efficient dynamic load balancing algorithm
Computational Mechanics
| Hi-index | 0.00 |
Evolutionary algorithms with a self-adaptive step control mechanism like evolution strategies (ES) often suffer from premature fitness stagnation on constrained numerical optimization problems. When the optimum lies on the constraint boundary or even in a vertex of the feasible search space, a disadvantageous success probability results in premature step size reduction. We introduce three new constraint-handling methods for ES on constrained continuous search spaces. The death penalty step control evolution strategy (DSES) is based on the controlled reduction of a minimum step size depending on the distance to the infeasible search space. The two sexes evolution strategy (TSES) is inspired by the biological concept of sexual selection and pairing. At last, the nested angle evolution strategy (NAES) is an approach in which the angles of the correlated mutation of the inner ES are adapted by the outer ES. All methods are experimentally evaluated on four selected test problems and compared with existing penalty-based constraint-handling methods.