Memetic Viability Evolution for Constrained Optimization
نویسندگان
چکیده
منابع مشابه
Supporting Information for: “Memetic Viability Evolution for Constrained Optimization”
is a candidate solution to the problem at hand. The reason for focusing our research on problems with inequalities only was threefold. The first reason, is purely algorithmic: the CMA-ES structure is indeed not feasible when the volume of the feasible region reduces to zero (which is the case of equality constraints). We discuss this aspect more in detail in Section 3. Secondly, specific techni...
متن کاملClassification-Assisted Memetic Algorithms for Equality-Constrained Optimization Problems
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps to alleviate the needs for expensive fitness function evaluations by performing local refinements on the approximated landscape. Classifications can alternatively be used to assist MA on the choice of individuals that...
متن کاملA Constraints Scattered Memetic Algorithm for Constrained Optimization Problem
In this paper, a constraints scattered memetic algorithm (CSMA), which integrates a novel constraints scattered genetic algorithm (CSGA) and the traditional interior point method, is proposed for solving constrained optimization problems. In CSGA, a constraint scattering operation, a sub-population crossover method and a new population performance evaluation mechanism are employed. The complete...
متن کاملMixed-Integer Constrained Optimization Based on Memetic Algorithm
Evolutionary algorithms (EAs) are population-based global search methods. They have been successfully applied to many complex optimization problems. However, EAs are frequently incapable of finding a convergence solution in default of local search mechanisms. Memetic Algorithms (MAs) are hybrid EAs that combine genetic operators with local search methods. With global exploration and local explo...
متن کاملModified Differential Evolution for Constrained Optimization [CEC7551]
In this paper, we present a Differential-Evolution based approach to solve constrained optimization problems. The aim of the approach is to increase the probability of each parent to generate a better offspring. This is done by allowing each solution to generate more than one offspring but using a different mutation operator which combines information of the best solution in the population and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2016
ISSN: 1089-778X,1089-778X,1941-0026
DOI: 10.1109/tevc.2015.2428292