This paper examines the effect of crossover operations on the performance of EMO algorithms through computational experiments on knapsack problems and flowshop scheduling problems using the NSGA-II algorithm. We focus on the relation between the performance of the NSGA-II algorithm and the similarity of recombined parent solutions. First we show the necessity of crossover operations through computational experiments with various specifications of crossover and mutation probabilities. Next we examine the relation between the performance of the NSGA-II algorithm and the similarity of recombined parent solutions. It is shown that the quality of obtained solution sets is improved by recombining similar parents. Then we examine the effect of increasing the selection pressure (i.e., increasing the tournament size) on the similarity of recombined parent solutions. An interesting observation is that the increase in the tournament size leads to the recombination of dissimilar parents, improves the diversity of solutions, and degrades the convergence performance of the NSGA-II algorithm. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Ishibuchi, H., & Narukawa, K. (2005). Recombination of similar parents in EMO algorithms. In Lecture Notes in Computer Science (Vol. 3410, pp. 265–279). Springer Verlag. https://doi.org/10.1007/978-3-540-31880-4_19
Mendeley helps you to discover research relevant for your work.