2005 | OriginalPaper | Chapter
Recombination of Similar Parents in EMO Algorithms
Authors : Hisao Ishibuchi, Kaname Narukawa
Published in: Evolutionary Multi-Criterion Optimization
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.