A self-adaptive linear evolutionary algorithm for solving constrained optimization problems

摘要

In many real-world applications of evolutionary algorithms,the fitness of an individual requires a quantitative measure.This paper proposes a self-adaptive linear evolutionary algorithm (ALEA) in which we introduce a novel strategy for evaluating individual's relative strengths and weaknesses.Based on this strategy,searching space of constrained optimization problems with high dimensions for design variables is compressed into two-dimensional performance space in which it is possible to quickly identify 'good' individuals of the performance for a multiobjective optimization application,regardless of original space complexity.This is considered as our main contribution.In addition,the proposed new evolutionary algorithm combines two basic operators with modification in reproduction phase,namely,crossover and mutation.Simulation results over a comprehensive set of benchmark functions show that the proposed strategy is feasible and effective,and provides good performance in terms of uniformity and diversity of solutions.