Abstract:

A modified evolutionary algorithm (MEA) is proposed to solve constrained optimization problems. Chaotic sequence method is introduced to construct the initialization population that is scattered uniformly over the entirely search space in order to maintain the diversity. In the evolution process, our algorithm is based on individual feasibility; the population is divided into feasible subpopulation and infeasible subpopulation, which evolve with different crossover operator and different mutation operator, respectively. Numerical simulation results on four benchmark problems demonstrate the effectiveness and robustness of the proposed algorithm. Several engineering optimization problems are designed to test the MEA, and the results show that the MEA can solve different constrained optimization problems.

Key words: constrained optimization problem;evolutionary algorithm;crossover;mutation;engineering application