On the Advantages of Searching Infeasible Regions in Constrained Evolutionary-Based Multi-Objective Engineering Optimization

Abstract

Solving a multiple-criteria optimization problem with severe constraints remains a significant issue in multi-objective evolutionary algorithms. The problem primarily stems from the need for a suitable constraint handling technique. One potential approach is balancing the search in feasible and infeasible regions to find the Pareto front efficiently. The justification for such a strategy is that the infeasible region also provides valuable information, especially in problems with a small percentage of feasibility areas. To that end, this paper investigates the potential of the infeasibility-driven principle based on multiple constraint ranking-based techniques to solve a multi-objective problem with a small feasibility ratio. By analyzing the results from intensive experiments on a set of test problems, including the realistic multi-objective car structure design and actuator design problem, it is shown that there is a significant improvement gained in terms of convergence by utilizing the generalized version of the multiple constraint ranking techniques.