U-NSGA-III: A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives: Proof-of-Principle Results

Evolutionary algorithms (EAs) have been systematically developed to solve mono-objective, multi-objective and many-objective problems, respectively, over the past few decades. Despite some efforts in unifying different types of mono-objective evolutionary and non-evolutionary algorithms, there does not exist too many studies to unify all three types of optimization problems together. In this study, we propose an unified evolutionary optimization algorithm U-NSGA-III, based on recently-proposed NSGA-III procedure for solving all three classes of problems. The \(\text{ U-NSGA-III }\) algorithm degenerates to an equivalent and efficient population-based optimization procedure for each class, just from the description of the number of specified objectives of a problem. The algorithm works with usual EA parameters and no additional tunable parameters are needed. The performance of \(\text{ U-NSGA-III }\) is compared with a real-coded genetic algorithm for mono-objective problems, with NSGA-II for two-objective problems, and with NSGA-III for three or more objective problems. Results amply demonstrate the merit of our proposed unified approach, encourage its further application, and motivate similar studies for a richer understanding of the development of optimization algorithms.

[1]  Aurora Trinidad Ramirez Pozo,et al.  I-MOPSO: A Suitable PSO Algorithm for Many-Objective Optimization , 2012, 2012 Brazilian Symposium on Neural Networks.

[2]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach , 2014, IEEE Transactions on Evolutionary Computation.

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

[4]  Xin Yao,et al.  Parallel Problem Solving from Nature PPSN VI , 2000, Lecture Notes in Computer Science.

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

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

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

[8]  Lucas Bradstreet,et al.  A Fast Incremental Hypervolume Algorithm , 2008, IEEE Transactions on Evolutionary Computation.

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

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

[11]  Hans-Paul Schwefel,et al.  Evolution strategies – A comprehensive introduction , 2002, Natural Computing.

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

[13]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

[14]  Kalyanmoy Deb,et al.  MULTI-OBJECTIVE FUNCTION OPTIMIZATION USING NON-DOMINATED SORTING GENETIC ALGORITHMS , 1994 .

[15]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[16]  Kalyanmoy Deb,et al.  A flexible optimization procedure for mechanical component design based on genetic adaptive search , 1998 .