| Abstract: |
This chapter investigates the convergence behavior of simple evolutionary algorithms with different selection strategies on a continuous multiobjective model problem. Special focus is given
to the problem of controlling the mutation strength, since an adaptation of the mutation strength is necessary to converge to the optimum with arbitrary precision, and to achieve linear
convergence order. Adaptive parameter control represents a major research topic in the field of evolutionary computation, and several methods have been proposed and applied successfully for
single-objective optimization problems. We demonstrate that the convergence properties achieved by a self-adaptation of the mutation strength on single-objective problems do not carry over to the
multiobjective case, if a simple dominance-based selection scheme is used. As a solution, a combined strategy is proposed using dominance-based selection in the archive and scalarizing functions
in the working population. |
