 |
    |
Recombination of Similar Parents in SMS-EMOA on Many-Objective 0/1 Knapsack Problems
Hisao Ishibuchi, Naoya Akedo, and Yusuke Nojima
Department of Computer Science and Intelligent Systems, Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Naka-ku, Sakai, Osaka 599-8531, Japanhisaoi@cs.osakafu-u.ac.jp
naoya.akedo@ci.cs.osakafu-u.ac.jp
nojima@cs.osakafu-u.ac.jp
Abstract. In the evolutionary multiobjective optimization (EMO) community, indicator-based evolutionary algorithms (IBEAs) have rapidly increased their popularity in the last few years thanks to their theoretical background and high search ability. Hypervolume has often been used as an indicator to measure the quality of solution sets in IBEAs. It has been reported in the literature that IBEAs work well on a wide range of multiobjective problems including many-objective problems on which traditional Pareto dominance-based EMO algorithms such as NSGA-II and SPEA2 do not always work well. In this paper, we examine the behavior of SMS-EMOA, which is a frequently-used representative IBEA with a hypervolume indicator function, through computational experiments on many-objective 0/1 knapsack problems. We focus on the effect of two mating strategies on the performance of SMS-EMOA: One is to select extreme parents far from other solutions in the objective space, and the other is to recombine similar parents. Experimental results show that the recombination of similar parents improves the performance of SMS-EMOA on many-objective problems whereas the selection of extreme parents is effective only for a two-objective problem. For comparison, we also examine the effect of these mating strategies on the performance of NSGA-II.
Keywords: Evolutionary multiobjective optimization, evolutionary manyobjective optimization, SMS-EMOA, mating schemes, knapsack problems
LNCS 7492, p. 132 ff.
lncs@springer.com
© Springer-Verlag Berlin Heidelberg 2012