This paper visually demonstrates the effect of crossover operations on the performance of EMO algorithms through computational experiments on multi-objective 0/1 knapsack problems. In our computational experiments, we use the NSGA-II algorithm as a representative EMO algorithm. First we compare the performance of the NSGA-II algorithm between two cases: NSGA-II with/without crossover. Experimental results show that the crossover operation has a positive effect on the convergence of solutions to the Pareto front and a negative effect on the diversity of solutions. That is, the crossover operation decreases the diversity of solutions while it improves the convergence of solutions to the Pareto front. Next we examine the effects of recombining similar or dissimilar parents using a similarity-based mating scheme. Experimental results show that the performance of the NSGA-II algorithm is improved by recombining similar parents and degraded by recombining dissimilar ones. Finally we show that the recombination of extreme and similar parents using the similarity-based mating scheme drastically improves the diversity of obtained non-dominated solutions without severely degrading their convergence to the Pareto front. An idea of dynamically controlling the selection pressure toward extreme and similar parents is also illustrated through computational experiments.
[1]
Hisao Ishibuchi,et al.
Recombination of Similar Parents in EMO Algorithms
,
2005,
EMO.
[2]
Hisao Ishibuchi,et al.
A Similarity-Based Mating Scheme for Evolutionary Multiobjective Optimization
,
2003,
GECCO.
[3]
Kalyanmoy Deb,et al.
A fast and elitist multiobjective genetic algorithm: NSGA-II
,
2002,
IEEE Trans. Evol. Comput..
[4]
Hisao Ishibuchi,et al.
Mating Scheme for Controlling the Diversity-Convergence Balance for Multiobjective Optimization
,
2004,
GECCO.
[5]
Hisao Ishibuchi,et al.
An Empirical Study on the Effect of Mating Restriction on the Search Ability of EMO Algorithms
,
2003,
EMO.
[6]
Lothar Thiele,et al.
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
,
1999,
IEEE Trans. Evol. Comput..