COARSE-EMOA: An indicator-based evolutionary algorithm for solving equality constrained multi-objective optimization problems

Abstract Many real-world applications involve dealing with several conflicting objectives which need to be optimized simultaneously. Moreover, these problems may require the consideration of limitations that restrict their decision variable space. Evolutionary Algorithms (EAs) are capable of tackling Multi-objective Optimization Problems (MOPs). However, these approaches struggle to accurately approximate a feasible solution when considering equality constraints as part of the problem due to the inability of EAs to find and keep solutions exactly at the constraint boundaries. Here, we present an indicator-based evolutionary multi-objective optimization algorithm (EMOA) for tackling Equality Constrained MOPs (ECMOPs). In our proposal, we adopt an artificially constructed reference set closely resembling the feasible Pareto front of an ECMOP to calculate the Inverted Generational Distance of a population, which is then used as a density estimator. An empirical study over a set of benchmark problems each of which contains at least one equality constraint was performed to test the capabilities of our proposed COnstrAined Reference SEt - EMOA (COARSE-EMOA). Our results are compared to those obtained by six other EMOAs. As will be shown, our proposed COARSE-EMOA can properly approximate a feasible solution by guiding the search through the use of an artificially constructed set that approximates the feasible Pareto front of a given problem.

[1]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

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

[3]  Xinye Cai,et al.  A comparative study of constrained multi-objective evolutionary algorithms on constrained multi-objective optimization problems , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

[4]  Valder Steffen,et al.  Treatment of Multi-objective Optimization Problem , 2017 .

[5]  Antonin Ponsich,et al.  A New Hybrid Evolutionary Algorithm for the Treatment of Equality Constrained MOPs , 2019, Mathematics.

[6]  Kalyanmoy Deb,et al.  Understanding Interactions among Genetic Algorithm Parameters , 1998, FOGA.

[7]  Hui Li,et al.  Angle-based constrained dominance principle in MOEA/D for constrained multi-objective optimization problems , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[8]  Weikang Ning,et al.  Constrained multi-objective optimization using constrained non-dominated sorting combined with an improved hybrid multi-objective evolutionary algorithm , 2017 .

[9]  Joel Nothman,et al.  SciPy 1.0-Fundamental Algorithms for Scientific Computing in Python , 2019, ArXiv.

[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]  Saúl Zapotecas Martínez,et al.  Using a Family of Curves to Approximate the Pareto Front of a Multi-Objective Optimization Problem , 2014, PPSN.

[12]  Abu S. S. M. Barkat Ullah,et al.  Handling equality constraints in evolutionary optimization , 2012, Eur. J. Oper. Res..

[13]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[14]  Carlos A. Coello Coello.  Constraint-handling techniques used with evolutionary algorithms , 2007, GECCO '07.

[15]  Kit Po Wong,et al.  Hybrid GA/SA algorithms for evaluating trade-off between economic cost and environmental impact in generation dispatch , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[16]  Changhe Li,et al.  Handling Constrained Many-Objective Optimization Problems via Problem Transformation , 2020, IEEE Transactions on Cybernetics.

[17]  Jianping Yin,et al.  Constrained multi-objective evolutionary algorithm based on decomposition for environmental/economic dispatch , 2014, 2014 IEEE Symposium on Computational Intelligence in Control and Automation (CICA).

[18]  S. Nash,et al.  Linear and Nonlinear Optimization , 2008 .

[19]  Abdollah Homaifar,et al.  Constrained Optimization Via Genetic Algorithms , 1994, Simul..

[20]  Kalyanmoy Deb,et al.  Analysing mutation schemes for real-parameter genetic algorithms , 2014, Int. J. Artif. Intell. Soft Comput..

[21]  Olivier Devillers,et al.  Walking in a triangulation , 2001, SCG '01.

[22]  M. Hansen,et al.  Evaluating the quality of approximations to the non-dominated set , 1998 .

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

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

[25]  R. W. Morris,et al.  The Wilcoxon rank sum test , 1976 .

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

[27]  Wei Chen,et al.  A Most Probable Point-Based Method for Efficient Uncertainty Analysis , 2001 .

[28]  Ye Tian,et al.  A multi-stage evolutionary algorithm for multi-objective optimization with complex constraints , 2021, Inf. Sci..

[29]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[30]  Hao Wang,et al.  The Set-Based Hypervolume Newton Method for Bi-Objective Optimization , 2020, IEEE Transactions on Cybernetics.

[31]  C. Coello.  TREATING CONSTRAINTS AS OBJECTIVES FOR SINGLE-OBJECTIVE EVOLUTIONARY OPTIMIZATION , 2000 .

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

[33]  Gary G. Yen,et al.  Differential evolution mutation operators for constrained multi-objective optimization , 2018, Appl. Soft Comput..

[34]  P. N. Suganthan,et al.  Ensemble of Constraint Handling Techniques , 2010, IEEE Transactions on Evolutionary Computation.

[35]  Carlos A. Coello Coello,et al.  Solving Multiobjective Optimization Problems Using an Artificial Immune System , 2005, Genetic Programming and Evolvable Machines.

[36]  Antonin Ponsich,et al.  A New Hybrid Metaheuristic for Equality Constrained Bi-objective Optimization Problems , 2019, EMO.

[37]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[38]  Oliver Schütze,et al.  A benchmark for equality constrained multi-objective optimization , 2020, Swarm Evol. Comput..

[39]  Tapabrata Ray,et al.  Equality Constrained Multi-objective optimization , 2012, 2012 IEEE Congress on Evolutionary Computation.

[40]  Sandra Paterlini,et al.  Multiobjective optimization using differential evolution for real-world portfolio optimization , 2011, Comput. Manag. Sci..

[41]  Thomas Stützle,et al.  An Empirical Assessment of the Properties of Inverted Generational Distance on Multi- and Many-Objective Optimization , 2017, EMO.

[42]  Carlos A. Coello Coello,et al.  Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[43]  Ernst P. Mücke,et al.  Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations , 1999, Comput. Geom..

[44]  Ye Tian,et al.  PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective Optimization [Educational Forum] , 2017, IEEE Computational Intelligence Magazine.

[45]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[46]  Tetsuyuki Takahama,et al.  Constrained Optimization by the ε Constrained Differential Evolution with Gradient-Based Mutation and Feasible Elites , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[47]  Hisao Ishibuchi,et al.  A Grid-Based Inverted Generational Distance for Multi/Many-Objective Optimization , 2020, IEEE Transactions on Evolutionary Computation.

[48]  K. Krishnamoorthy.  Wilcoxon Rank-Sum Test , 2006 .

[49]  V. B. Surya Prasath,et al.  Choosing Mutation and Crossover Ratios for Genetic Algorithms - A Review with a New Dynamic Approach , 2019, Inf..

[50]  Pradnya A. Vikhar,et al.  Evolutionary algorithms: A critical review and its future prospects , 2016, 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC).

[51]  Günter Rudolph,et al.  The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems , 2015, NEO.

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

[53]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation) , 2006 .

[54]  Tao Zhang,et al.  A Coevolutionary Framework for Constrained Multiobjective Optimization Problems , 2021, IEEE Transactions on Evolutionary Computation.

[55]  Oliver Schütze,et al.  Pareto Tracer: a predictor–corrector method for multi-objective optimization problems , 2018 .

[56]  Carlos A. Coello Coello,et al.  THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .

[57]  Jun Zhang,et al.  Tri-Goal Evolution Framework for Constrained Many-Objective Optimization , 2020, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

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