Abstract

This paper focuses on the issue of evaluation of constraints handling methods, as the advantages and disadvantages of various methods are not well understood. The general way of dealing with constraints -- whatever the optimization method -- is by penalizing infeasible points. However, there are no guidelines on designing penalty functions. Some suggestions for evolutionary algorithms are given in [37], but they do not generalize. Other techniques that can be used to handle constraints in are more or less problem dependent. For instance, the knowledge about linear constraints can be incorporated into specific operators [24], or a repair operator can be designed that projects infeasible points onto feasible ones [30]

Citations