Niching Diversity Estimation for Multi-modal Multi-objective Optimization

Niching is an important and widely used technique in evolutionary multi-objective optimization. Its applications mainly focus on maintaining diversity and avoiding early convergence to local optimum. Recently, a special class of multi-objective optimization problems, namely, multi-modal multi-objective optimization problems (MMOPs), started to receive increasing attention. In MMOPs, a solution in the objective space may have multiple inverse images in the decision space, which are termed as equivalent solutions. Since equivalent solutions are overlapping (i.e., occupying the same position) in the objective space, standard diversity estimators such as crowding distance are likely to select one of them and discard the others, which may cause diversity loss in the decision space. In this study, a general niching mechanism is proposed to make standard diversity estimators more efficient when handling MMOPs. In our experiments, we integrate our proposed niching diversity estimation method into SPEA2 and NSGA-II and evaluate their performance on several MMOPs. Experimental results show that the proposed niching mechanism notably enhances the performance of SPEA2 and NSGA-II on various MMOPs.

[1]  Bernard W. Silverman,et al.  Density Estimation for Statistics and Data Analysis , 1987 .

[2]  Tomohiro Yoshikawa,et al.  A study on analysis of design variables in Pareto solutions for conceptual design optimization problem of hybrid rocket engine , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[3]  Martin J. Oates,et al.  PESA-II: region-based selection in evolutionary multiobjective optimization , 2001 .

[4]  Hisao Ishibuchi,et al.  A Double-Niched Evolutionary Algorithm and Its Behavior on Polygon-Based Problems , 2018, PPSN.

[5]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[6]  Massimiliano Vasile,et al.  Computing the Set of Epsilon-Efficient Solutions in Multiobjective Space Mission Design , 2011, J. Aerosp. Comput. Inf. Commun..

[7]  Oliver Kramer,et al.  DBSCAN-based multi-objective niching to approximate equivalent pareto-subsets , 2010, GECCO '10.

[8]  Hisao Ishibuchi,et al.  A Decomposition-Based Evolutionary Algorithm for Multi-modal Multi-objective Optimization , 2018, PPSN.

[9]  Hisao Ishibuchi,et al.  Modified Distance Calculation in Generational Distance and Inverted Generational Distance , 2015, EMO.

[10]  P. J. Green,et al.  Density Estimation for Statistics and Data Analysis , 1987 .

[11]  Shengxiang Yang,et al.  Shift-Based Density Estimation for Pareto-Based Algorithms in Many-Objective Optimization , 2014, IEEE Transactions on Evolutionary Computation.

[12]  Jing J. Liang,et al.  A Multiobjective Particle Swarm Optimizer Using Ring Topology for Solving Multimodal Multiobjective Problems , 2018, IEEE Transactions on Evolutionary Computation.

[13]  Zexuan Zhu,et al.  Multimodal Multiobjective Evolutionary Optimization With Dual Clustering in Decision and Objective Spaces , 2021, IEEE Transactions on Evolutionary Computation.

[14]  Qingfu Zhang,et al.  Approximating the Set of Pareto-Optimal Solutions in Both the Decision and Objective Spaces by an Estimation of Distribution Algorithm , 2009, IEEE Transactions on Evolutionary Computation.

[15]  Kalyanmoy Deb,et al.  Omni-optimizer: A generic evolutionary algorithm for single and multi-objective optimization , 2008, Eur. J. Oper. Res..

[16]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[17]  Hisao Ishibuchi,et al.  A Review of Evolutionary Multimodal Multiobjective Optimization , 2020, IEEE Transactions on Evolutionary Computation.

[18]  Günter Rudolph,et al.  Capabilities of EMOA to Detect and Preserve Equivalent Pareto Subsets , 2007, EMO.

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