Memetic Viability Evolution for Constrained Optimization
Authors:
- 6 May 2015
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 20 (1) , 125-144
Abstract
The performance of evolutionary algorithms can be heavily undermined when constraints limit the feasible areas of the search space. For instance, while covariance matrix adaptation evolution strategy (CMA-ES) is one of the most efficient algorithms for unconstrained optimization problems, it cannot be readily applied to constrained ones. Here, we used concepts from memetic computing, i.e., the harmonious combination of multiple units of algorithmic information, and viability evolution, an alternative abstraction of artificial evolution, to devise a novel approach for solving optimization problems with inequality constraints. Viability evolution emphasizes the elimination of solutions that do not satisfy viability criteria, which are defined as boundaries on objectives and constraints. These boundaries are adapted during the search to drive a population of local search units, based on CMA-ES, toward feasible regions. These units can be recombined by means of differential evolution operators. Of crucial importance for the performance of our method, an adaptive scheduler toggles between exploitation and exploration by selecting to advance one of the local search units and/or recombine them. The proposed algorithm can outperform several state-of-the-art methods on a diverse set of benchmark and engineering problems, both for quality of solutions and computational resources needed.Keywords
All Related Versions
Funding Information
- Swiss National Science Foundation (141063)
This publication has 90 references indexed in Scilit:
- Mine blast algorithm: A new population based algorithm for solving constrained engineering optimization problemsApplied Soft Computing, 2013
- A hybrid approach based on differential evolution and tissue membrane systems for solving constrained manufacturing parameter optimization problemsApplied Soft Computing, 2013
- A penalty function-based differential evolution algorithm for constrained global optimizationComputational Optimization and Applications, 2012
- Evaluating differential evolution with penalty function to solve constrained engineering problemsExpert Systems with Applications, 2012
- Ockham’s Razor in memetic computing: Three stage optimal memetic explorationInformation Sciences, 2012
- Constraint-handling in nature-inspired numerical optimization: Past, present and futureSwarm and Evolutionary Computation, 2011
- AMA: a new approach for solving constrained real-valued optimization problemsSoft Computing, 2008
- An effective co-evolutionary particle swarm optimization for constrained engineering design problemsEngineering Applications of Artificial Intelligence, 2007
- Constraint-handling in genetic algorithms through the use of dominance-based tournament selectionAdvanced Engineering Informatics, 2002
- Evolutionary algorithms for constrained engineering problemsComputers & Industrial Engineering, 1996