A new constraint handling method based on the modified Alopex-based evolutionary algorithm

摘要

In this paper, a new constraint handling method based on a modified AEA (Alopex-based evolutionary algorithm) is proposed. Combined with a new proposed ranking and selecting strategy, the algorithm gradually converges to a feasible region from a relatively feasible region. By introduction of an adaptive relaxation parameter μ, the algorithm fully takes into account different functions corresponding to different sizes of feasible region. In addition, an adaptive penalty function method is employed, which adap-tively adjust the penalty coefficient so as to guarantee a moderate penalty. By solving 11 benchmark test functions and two engineering problems, experiment results indicate that the proposed method is reliable and efficient for solving constrained optimization problems. Also, it has great potential in handling many engineering problems with constraints, even with equations.