On the importance of isolated infeasible solutions in the many-objective constrained NSGA-III

Abstract Recently, decomposition has gained a wide interest in solving Multi-objective Optimization Problems (MOPs) involving more than three objectives also known as Many-objective Optimization Problems (MaOPs). In the last few years, there have been many proposals to use decomposition to solve unconstrained problems. However, fewer is the amount of works that has been devoted to propose new decomposition-based algorithms to solve Constrained MaOPs (CMaOPs). In this paper, we propose the ISC-Pareto dominance (Isolated Solution-based Constrained Pareto dominance) relation that has the ability to: (1) handle CMaOPs characterized by different types of difficulties and (2) favor the selection of not only infeasible solutions associated to isolated subregions but also infeasible solutions with smaller CV (Constraint Violation) values. Our constraint handling strategy has been integrated into the framework of the Constrained Non-Dominated Sorting Genetic Algorithm-III (C-NSGA-III) to produce a new algorithm called Isolated Solution-based Constrained NSGA-III (ISC-NSGA-III). The empirical results have demonstrated that our constraint handling strategy is able to provide better and competitive results when compared against three recently proposed constrained decomposition-based Many-Objective Evolutionary Algorithms (MaOEAs) in addition to a penalty-based version of NSGA-III on the CDTLZ benchmark problems involving up to fifteen objectives. Moreover, the efficacy of ISC-NSGA-III on a real world water management problem is showcased.

[1]  Marco Laumanns,et al.  Scalable Test Problems for Evolutionary Multiobjective Optimization , 2005, Evolutionary Multiobjective Optimization.

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

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

[4]  Swagatam Das,et al.  LINEAR ANTENNA ARRAY SYNTHESIS WITH CONSTRAINED MULTI-OBJECTIVE DIFFERENTIAL EVOLUTION , 2010, Progress In Electromagnetics Research B.

[5]  Qingfu Zhang,et al.  Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II , 2009, IEEE Transactions on Evolutionary Computation.

[6]  Peter J. Bentley,et al.  Finding Acceptable Solutions in the Pareto-Optimal Range using Multiobjective Genetic Algorithms , 1998 .

[7]  Sujin Bureerat,et al.  Four-bar linkage path generation through self-adaptive population size teaching-learning based optimization , 2017, Knowl. Based Syst..

[8]  Saúl Zapotecas Martínez,et al.  A multi-objective evolutionary algorithm based on decomposition for constrained multi-objective optimization , 2014, IEEE Congress on Evolutionary Computation.

[9]  Xinye Cai,et al.  Epsilon constrained method for constrained multiobjective optimization problems: some preliminary results , 2014, GECCO.

[10]  D.A. Van Veldhuizen,et al.  On measuring multiobjective evolutionary algorithm performance , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[11]  Lamjed Ben Said,et al.  Steady state IBEA assisted by MLP neural networks for expensive multi-objective optimization problems , 2014, GECCO.

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

[13]  Lei Wang,et al.  MOEA/D-ARA+SBX: A new multi-objective evolutionary algorithm based on decomposition with artificial raindrop algorithm and simulated binary crossover , 2016, Knowl. Based Syst..

[14]  Seyed Mohammad Mirjalili,et al.  Truss optimization with natural frequency bounds using improved symbiotic organisms search , 2017, Knowl. Based Syst..

[15]  Zbigniew Michalewicz,et al.  Evolutionary algorithms for constrained engineering problems , 1996, Computers & Industrial Engineering.

[16]  P. Reed,et al.  Managing population and drought risks using many‐objective water portfolio planning under uncertainty , 2009 .

[17]  Vivek K. Patel,et al.  Adaptive symbiotic organisms search (SOS) algorithm for structural design optimization , 2016, J. Comput. Des. Eng..

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

[19]  Ghanshyam G. Tejani,et al.  Truss topology optimization with static and dynamic constraints using modified subpopulation teaching–learning-based optimization , 2016 .

[20]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

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

[22]  Qingfu Zhang,et al.  MOEA/D for constrained multiobjective optimization: Some preliminary experimental results , 2010, 2010 UK Workshop on Computational Intelligence (UKCI).

[23]  Hua Xu,et al.  An Experimental Investigation of Variation Operators in Reference-Point Based Many-Objective Optimization , 2015, GECCO.

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

[25]  Michael M. Skolnick,et al.  Using Genetic Algorithms in Engineering Design Optimization with Non-Linear Constraints , 1993, ICGA.

[26]  Lamjed Ben Said,et al.  On the importance of isolated solutions in constrained decomposition-based many-objective optimization , 2017, GECCO.

[27]  Antonio J. Nebro,et al.  jMetal: A Java framework for multi-objective optimization , 2011, Adv. Eng. Softw..

[28]  Tapabrata Ray,et al.  A Pareto Corner Search Evolutionary Algorithm and Dimensionality Reduction in Many-Objective Optimization Problems , 2011, IEEE Transactions on Evolutionary Computation.

[29]  Tapabrata Ray,et al.  An adaptive constraint handling approach embedded MOEA/D , 2012, 2012 IEEE Congress on Evolutionary Computation.

[30]  Yi Cui,et al.  Self-adapted mixture distance measure for clustering uncertain data , 2017, Knowl. Based Syst..

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

[32]  Dan Wang,et al.  A constrained multiobjective evolutionary algorithm based decomposition and temporary register , 2013, 2013 IEEE Congress on Evolutionary Computation.

[33]  E. Wegman.  Hyperdimensional Data Analysis Using Parallel Coordinates , 1990 .

[34]  R. Courant.  Variational methods for the solution of problems of equilibrium and vibrations , 1943 .

[35]  Muhammad Asif Jan,et al.  Threshold Based Dynamic and Adaptive Penalty Functions for Constrained Multiobjective Optimization , 2013, 2013 1st International Conference on Artificial Intelligence, Modelling and Simulation.

[36]  Markus Olhofer,et al.  Test Problems for Large-Scale Multiobjective and Many-Objective Optimization , 2017, IEEE Transactions on Cybernetics.

[37]  Carlos A. Coello Coello,et al.  Constraint-handling in nature-inspired numerical optimization: Past, present and future , 2011, Swarm Evol. Comput..

[38]  Kalyanmoy Deb,et al.  Constrained Test Problems for Multi-objective Evolutionary Optimization , 2001, EMO.

[39]  N. Ramaraj,et al.  A novel hybrid feature selection via Symmetrical Uncertainty ranking based local memetic search algorithm , 2010, Knowl. Based Syst..

[40]  Tetsuyuki Takahama,et al.  Constrained Optimization by the epsilon Constrained Hybrid Algorithm of Particle Swarm Optimization and Genetic Algorithm , 2005, Australian Conference on Artificial Intelligence.

[41]  Rolf Drechsler,et al.  Robust Multi-Objective Optimization in High Dimensional Spaces , 2007, EMO.

[42]  F. Wilcoxon.  Individual Comparisons by Ranking Methods , 1945 .

[43]  Leslie Pérez Cáceres,et al.  The irace package: Iterated racing for automatic algorithm configuration , 2016 .

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

[45]  Hisao Ishibuchi,et al.  Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes , 2017, IEEE Transactions on Evolutionary Computation.

[46]  Yahya Rahmat-Samii,et al.  Electromagnetic Optimization by Genetic Algorithms , 1999 .

[47]  Qingfu Zhang,et al.  Multiobjective optimization Test Instances for the CEC 2009 Special Session and Competition , 2009 .

[48]  Carlos A. Coello Coello,et al.  Some techniques to deal with many-objective problems , 2009, GECCO '09.

[49]  Joseph J. Talavage,et al.  A Tradeoff Cut Approach to Multiple Objective Optimization , 1980, Oper. Res..

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

[51]  Sujin Bureerat,et al.  Topology and Size Optimization of Trusses with Static and Dynamic Bounds by Modified Symbiotic Organisms Search , 2018, J. Comput. Civ. Eng..

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

[53]  Xin Yao,et al.  How to Read Many-Objective Solution Sets in Parallel Coordinates [Educational Forum] , 2017, IEEE Computational Intelligence Magazine.

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

[55]  Qingfu Zhang,et al.  Hybridization of Decomposition and Local Search for Multiobjective Optimization , 2014, IEEE Transactions on Cybernetics.

[56]  Marco Farina,et al.  A fuzzy definition of "optimality" for many-criteria optimization problems , 2004, IEEE Trans. Syst. Man Cybern. Part A.

[57]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[58]  T. Simpson,et al.  Conceptual design of a family of products through the use of the robust concept exploration method , 1996 .

[59]  Qingfu Zhang,et al.  An Evolutionary Many-Objective Optimization Algorithm Based on Dominance and Decomposition , 2015, IEEE Transactions on Evolutionary Computation.

[60]  Wang Yu-ping,et al.  A new uniform evolutionary algorithm based on decomposition and CDAS for many-objective optimization , 2015 .

[61]  Tapabrata Ray,et al.  Design of a toy submarine using underwater vehicle design optimization framework , 2011, 2011 IEEE Symposium on Computational Intelligence in Vehicles and Transportation Systems (CIVTS) Proceedings.

[62]  Francisco Herrera,et al.  A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms , 2011, Swarm Evol. Comput..

[63]  Rolf Drechsler,et al.  Multi-objected Optimization in Evolutionary Algorithms Using Satisfiability Classes , 1999, Fuzzy Days.

[64]  Carlos A. Coello Coello,et al.  Objective reduction using a feature selection technique , 2008, GECCO '08.

[65]  Chih-Cheng Hung,et al.  Solving many-objective problems using targeted search directions , 2016, SAC.

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