Diversity-Indicator Based Multi-Objective Evolutionary Algorithm: DI-MOEA

In this paper we propose a Diversity-Indicator based Multi-Objective Evolutionary Algorithm (DI-MOEA) for fast computation of evenly spread Pareto front approximations. Indicator-based optimization has been a successful principle for multi-objective evolutionary optimization algorithm (MOEA) design. The idea is to guide the search for approximating the Pareto front by a performance indicator. Ideally, the indicator captures both convergence to the Pareto front and a high diversity, and it does not require a priori knowledge of the Pareto front shape and location. It is, however, so far difficult to define indicators that scale well in computation time for high dimensional objective spaces, and that distribute points evenly on the Pareto front. Moreover, the behavior of commonly applied indicators depends on additional information, such as reference points or sets. The proposed DI-MOEA adopts a hybrid search scheme for combining the advantages of Pareto dominance-based approaches to ensure fast convergence to the Pareto front, with indicator based approaches to ensure convergence to an evenly distributed, diverse set. In addition, it avoids the use of complex structure and parameters in decomposition-based approaches. The Euclidean distance-based geometric mean gap is used as diversity indicator. Experimental results show that the new algorithm can find uniformly spaced Pareto fronts without the involvement of any reference points or sets. Most importantly, our algorithm performs well on both the hypervolume indicator and IGD when comparing with state-of-the-art MOEAs (NSGA-II, SMS-EMOA, MOEA/D and NSGA-III).

[1]  Jay B. Ghosh,et al.  Computational aspects of the maximum diversity problem , 1996, Oper. Res. Lett..

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

[3]  Nicola Beume,et al.  SMS-EMOA: Multiobjective selection based on dominated hypervolume , 2007, Eur. J. Oper. Res..

[4]  Michael T. M. Emmerich,et al.  Indicator-Based Evolutionary Level Set Approximation: Mixed Mutation Strategy and Extended Analysis , 2017, IWINAC.

[5]  Pravin M. Vaidya,et al.  AnO(n logn) algorithm for the all-nearest-neighbors Problem , 1989, Discret. Comput. Geom..

[6]  Peter J. Fleming,et al.  Generalized decomposition and cross entropy methods for many-objective optimization , 2014, Inf. Sci..

[7]  Eckart Zitzler,et al.  Indicator-Based Selection in Multiobjective Search , 2004, PPSN.

[8]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[9]  Michael T. M. Emmerich,et al.  On Quality Indicators for Black-Box Level Set Approximation , 2013, EVOLVE.

[10]  Thomas Hanne,et al.  On the convergence of multiobjective evolutionary algorithms , 1999, Eur. J. Oper. Res..

[11]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[12]  P. Hajela,et al.  Genetic search strategies in multicriterion optimal design , 1991 .

[13]  Lothar Thiele,et al.  Defining and Optimizing Indicator-Based Diversity Measures in Multiobjective Search , 2010, PPSN.

[14]  Simon Wessing Two-stage methods for multimodal optimization , 2015 .