MM-NAEMO : Multimodal Neighborhood-sensitive Archived Evolutionary Many-objective Optimization Algorithm

In certain multi-objective optimization problems, it may happen that there are two or more different Pareto optimal sets corresponding to the exact same Pareto Front. These are known as multimodal multi-objective optimization problems (MMOPs). Algorithms which are able to generate all the Pareto sets can provide more flexibility in choosing solutions and therefore a possible improvement in the performance. In this work, we build upon the original framework of NAEMO (Neighborhood-sensitive Archived Evolutionary Many-objective Optimization Algorithm) and present Multimodal NAEMO (MM-NAEMO). In MM-NAEMO, the mutation occurs between the points which are local neighbors and each reference line always keeps at least two or more candidate solutions associated with it. Clustering is used to maintain the diversity in the population associated with each reference line, thus providing multiple Pareto sets as output. The algorithm is tested on the test problems of MMO test suite of CEC2019. The experimental results suggest that the proposed algorithm effectively finds majority of the Pareto sets without hampering the Pareto fronts for most of the problems.

[1]  John E. Dennis,et al.  Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems , 1998, SIAM J. Optim..

[2]  Michael J. Pelosi,et al.  Dynamic-Radius Species-Conserving Genetic Algorithm for the Financial Forecasting of Dow Jones Index Stocks , 2013, MLDM.

[3]  Jing J. Liang,et al.  A survey on multi-objective evolutionary algorithms for the solution of the environmental/economic dispatch problems , 2018, Swarm Evol. Comput..

[4]  Monalisa Pal,et al.  NAEMO: Neighborhood-sensitive archived evolutionary many-objective optimization algorithm , 2019, Swarm Evol. Comput..

[5]  Jing J. Liang,et al.  A novel scalable test problem suite for multimodal multiobjective optimization , 2019, Swarm Evol. Comput..

[6]  Gary G. Yen,et al.  A Multimodal Multiobjective Evolutionary Algorithm Using Two-Archive and Recombination Strategies , 2019, IEEE Transactions on Evolutionary Computation.

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

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

[9]  Franciszek Seredynski.  Evolutionary Paradigms , 2006, Handbook of Nature-Inspired and Innovative Computing.

[10]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[11]  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.

[12]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[13]  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.

[14]  Qingfu Zhang,et al.  This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 RM-MEDA: A Regularity Model-Based Multiobjective Estimation of , 2022 .

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