Solving multi-scenario cardinality constrained optimization problems via multi-objective evolutionary algorithms

2019 ◽  
Vol 62 (9) ◽  
Author(s):  
Xing Zhou ◽  
Huaimin Wang ◽  
Wei Peng ◽  
Bo Ding ◽  
Rui Wang
Keyword(s):  
Evolutionary Algorithms ◽  
Constrained Optimization ◽  
Optimization Problems ◽  
Constrained Optimization Problems ◽  
Multi Objective

Composite Evolutionary Algorithm for Constrained Optimization

2012 ◽  
Vol 220-223 ◽  
pp. 2846-2851
Author(s):  
Si Lian Xie ◽  
Tie Bin Wu ◽  
Shui Ping Wu ◽  
Yun Lian Liu
Keyword(s):  
Evolutionary Algorithms ◽  
Constrained Optimization ◽  
Evolutionary Algorithm ◽  
Selection Criteria ◽  
Optimization Problems ◽  
Experimental Results ◽  
Constrained Optimization Problems ◽  
Mutation Operators ◽  
Single Operator ◽  
Algorithm Framework

Evolutionary algorithms are amongst the best known methods of solving difficult constrained optimization problems, for which traditional methods are not applicable. Due to the variability of characteristics in different constrained optimization problems, no single evolutionary with single operator performs consistently over a range of problems. We introduce an algorithm framework that uses multiple search operators in each generation. A composite evolutionary algorithm is proposed in this paper and combined feasibility rule to solve constrained optimization problems. The proposed evolutionary algorithm combines three crossover operators with two mutation operators. The selection criteria based on feasibility of individual is used to deal with the constraints. The proposed method is tested on five well-known benchmark constrained optimization problems, and the experimental results show that it is effective and robust

Sign in / Sign up

Export Citation Format

Share Document