Effects of the use of non-geometric binary crossover on evolutionary multiobjective optimization

In the design of evolutionary multiobjective optimization (EMO) algorithms, it is important to strike a balance between diversity and convergence. Traditional mask-based crossover operators for binary strings (e.g., one-point and uniform) tend to decrease the diversity of solutions in EMO algorithms while they improve the convergence to the Pareto front. This is because such a crossover operator, which is called geometric crossover, always generates an offspring in the segment between its two parents under the Hamming distance in the genotype space. That is, the sum of the distances from the generated offspring to its two parents is always equal to the distance between the parents. In this paper, first we propose a non-geometric binary crossover operator to generate an offspring outside the segment between its parents. Next we examine the effect of the use of non-geometric binary crossover on single-objective genetic algorithms. Experimental results show that non-geometric binary crossover improves their search ability. Then we examine its effect on EMO algorithms. Experimental results show that non-geometric binary crossover drastically increases the diversity of solutions while it slightly degrades their convergence to the Pareto front. As a result, some performance measures such as hypervolume are clearly improved.

[1]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[2]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[3]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[4]  Hisao Ishibuchi,et al.  Mating Scheme for Controlling the Diversity-Convergence Balance for Multiobjective Optimization , 2004, GECCO.

[5]  Kalyanmoy Deb,et al.  Real-coded Genetic Algorithms with Simulated Binary Crossover: Studies on Multimodal and Multiobjective Problems , 1995, Complex Syst..

[6]  Riccardo Poli,et al.  Inbreeding properties of geometric crossover and non-geometric recombinations , 2007, FOGA'07.

[7]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[8]  Alden H. Wright,et al.  Genetic Algorithms for Real Parameter Optimization , 1990, FOGA.

[9]  Hisao Ishibuchi,et al.  Comparison Between Lamarckian and Baldwinian Repair on Multiobjective 0/1 Knapsack Problems , 2005, EMO.

[10]  Dirk Thierens,et al.  The balance between proximity and diversity in multiobjective evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[11]  Riccardo Poli,et al.  Topological Interpretation of Crossover , 2004, GECCO.

[12]  Tomoyuki Hiroyasu,et al.  NCGA: Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems , 2002, GECCO Late Breaking Papers.

[13]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[14]  Tomoyuki Hiroyasu,et al.  SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2 , 2004, PPSN.

[15]  Hisao Ishibuchi,et al.  Recombination of Similar Parents in EMO Algorithms , 2005, EMO.

[16]  Peter J. Fleming,et al.  On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers , 1996, PPSN.

[17]  T. Hiroyasu,et al.  NEIGHBORHOOD CULTIVATION GENETIC ALGORITHM FOR MULTI-OBJECTIVE OPTIMIZATION PROBLEMS , 2002 .

[18]  Heinz Mühlenbein,et al.  Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.

[19]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[20]  Piotr Czyzżak,et al.  Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization , 1998 .

[21]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[22]  Isao Ono,et al.  A Real Coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distributed Crossover , 1997, ICGA.

[23]  Riccardo Poli,et al.  Product Geometric Crossover , 2006, PPSN.

[24]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[25]  Andrzej Jaszkiewicz,et al.  On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment , 2002, IEEE Trans. Evol. Comput..

[26]  Hisao Ishibuchi,et al.  An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization , 2008, Eur. J. Oper. Res..