On utilizing infeasibility in multiobjective evolutionary algorithms

Abstract

In this article, we consider the problem of infeasible solutions (i.e. solutions which violate one or several restrictions of an optimization problem) which can hardly be avoided when new solutions are generated by stochastic and other means during the run of an optimization algorithm. Since typical approaches for dealing with infeasibility such as using a repair mechanism, a punishment approach, or a simple recalculation of solutions are not fully satisfying in many problems, we suggest a new approach of tolerating and actively using infeasible solutions within the framework of multiobjective evolutionary algorithms. The novel evolutionary algorithm allows solving a multiobjective optimization problem (MOP) with continuous variables by approximating the efficient set. The algorithm uses populations of variable size and new rules for selecting solutions for the subsequent generations. In particular, some of the selected solutions may be infeasible such that the Pareto front is approached at the same time from two sides, the feasible set and a subset of the infeasible set. Since the considered in feasible solutions correspond to a dual optimization problem, we call the new algorithm primaldual multiobjective optimization algorithm, or PDMOEA. The algorithm is demonstrated by considering a numerical test problem and is compared with two other approaches for dealing with infeasibility. The example shows a specific strength of the new approach: By tunneling through infeasible regions, the population may more easily extent to new separated parts of the Pareto set.