Adaptive ε-Sampling and ε-Hood for Evolutionary Many-Objective Optimization

Many-objective problems are becoming common in several real-world application domains and there is a growing interest to develop evolutionary many-objective optimizers that can solve them effectively. Studies on selection for many-objective optimization and most recently studies on the characteristics of many-objective landscapes, the effectiveness of operators of variation, and the effects of large populations have proved successful to advance our understanding of evolutionary many-objective optimization. This work proposes an evolutionary many-objective optimization algorithm that uses adaptive e-dominance principles to select survivors and also to create neighborhoods to bias mating, so that solutions will recombine with other solutions located close by in objective space. We investigate the performance of the proposed algorithm on DTLZ continuous problems, using a short number of generations to evolve the population, varying population size from 100 to 20000 individuals. Results show that the application of adaptive e-dominance principles for survival selection as well as for mating selection improves considerably the performance of the optimizer.

[1]  Kiyoshi Tanaka,et al.  A Study on Large Population MOEA Using Adaptive ε-Box Dominance and Neighborhood Recombination for Many-Objective Optimization , 2012, LION.

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

[3]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[4]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[5]  Kiyoshi Tanaka,et al.  Working principles, behavior, and performance of MOEAs on MNK-landscapes , 2007, Eur. J. Oper. Res..

[6]  Marco Laumanns,et al.  Combining Convergence and Diversity in Evolutionary Multiobjective Optimization , 2002, Evolutionary Computation.

[7]  Vincenzo Cutello,et al.  Parallel Problem Solving from Nature - PPSN XII , 2012, Lecture Notes in Computer Science.

[8]  Hisao Ishibuchi,et al.  Evolutionary many-objective optimization: A short review , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[9]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[10]  Kiyoshi Tanaka,et al.  Insights on properties of multiobjective MNK-landscapes , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[11]  Kiyoshi Tanaka,et al.  Genetic Diversity and Effective Crossover in Evolutionary Many-objective Optimization , 2011, LION.

[12]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

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

[14]  Kiyoshi Tanaka,et al.  Analysis on Population Size and Neighborhood Recombination on Many-Objective Optimization , 2012, PPSN.