One of the most promising approaches of handling constrained optimization problems (COPs) is to adopt multi-objective methods, which can provide a trade-off between the objective and constraints. However, the multi-objective-based constraint-handling techniques take preference over infeasible solutions, some promising feasible solutions cannot survive during the course of search because they are dominated ones. Furthermore, some nondominated infeasible solutions with worse objective values should not be reserved in that they are far from the feasible optimal solution. To address these two problems, this paper proposes a Pareto front transformation model which transforms a part of potential feasible solutions into nondominated ones. Meanwhile, combined with the dynamic multi-objective technique, certain nondominated infeasible solutions with worse objective values will be rejected. In this way, the search can towards the global optimum from both the feasible and infeasible sides of the search space. The proposed Pareto front transformation model is integrated into a multi-objective-based constrained evolutionary algorithm (CEA). The new designed algorithm is named PT-MOEA, and it is compared with seven peer multi-objective-based CEAs and five state-of-the-art CEAs on solving IEEE CEC 2006 and IEEE CEC 2010 test suites, respectively. Experimental results demonstrate the competitiveness of the proposed method in comparison with its competitors for solving COPs.
Discussion(0)
No comments yet. Be the first to comment.