MOBES : A multiobjective evolution strategy for constrained optimization problems
To Thanh Binh · 1997
In this paper a new MultiOBjective Evolution Strategy (MOBES) for solving multiobjective optimization problems subject to linear and nonlinear constraints is presented. MOBES is based on the new concept of C-, F - and N-fitness, which allows systematically to handle constraints and (in)feasible individuals. The existence of niche infeasible individuals in every population enables to explore new areas of the feasible region and new feasible pareto-optimal solutions. Moreover, MOBES proposed a new selection algorithm for searching, maintaining a set of feasible pareto-optimal solutions in every generation. The performance of the MOBES can be successfully evaluated on two selected test problems.