Equality Constrained Multi-objective optimization

The Evolutionary Algorithms community have had lukewarm interest in Equality constrained Multi-objective (MO) Optimization problems so far. Recently, we proposed a Most Probable Point (MPP) based repair method for equality constraint handling, where we concentrated on single-objective optimization problems. In the present work, we focus our attention to equality constrained MO optimization. We first propose a set of equality constrained MO test problems (having upto 30 variables) and then suggest a more pragmatic clustering based method for selecting the infeasible solutions to be repaired which reduces the number of function evaluations considerably. The repair procedure is integrated with the popular Evolutionary MO optimization (EMO) procedure, the NSGA-II. The results will show that the proposed procedure reaches the feasible state faster, as compared to NSGA-II for all the test problems and hence show promise as an effective method for handling equality constraints in MO optimization.

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

[2]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[3]  A. Messac,et al.  Equality Constraints in Multiobjective Robust Design Optimization: Implications and Tradeoffs , 2005 .

[4]  Xiaoping Du,et al.  Reliability‐based design optimization with equality constraints , 2007 .

[5]  Kalyanmoy Deb,et al.  A Bi-objective Based Hybrid Evolutionary-Classical Algorithm for Handling Equality Constraints , 2011, EMO.

[6]  Chee Keong Kwoh,et al.  Classification-assisted memetic algorithms for solving optimization problems with restricted equality constraint function mapping , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

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

[8]  Qingfu Zhang,et al.  Adaptive Operator Selection With Bandits for a Multiobjective Evolutionary Algorithm Based on Decomposition , 2014, IEEE Transactions on Evolutionary Computation.

[9]  Kalyanmoy Deb,et al.  Hybrid gradient projection based Genetic Algorithms for constrained optimization , 2010, IEEE Congress on Evolutionary Computation.

[10]  Shuhei Kimura,et al.  Constrained multimodal function optimization using a simple evolutionary algorithm , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[11]  E. Nikolaidis,et al.  Reliability based optimization: A safety index approach , 1988 .

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

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

[14]  Xiaoping Du,et al.  A MOST PROBABLE POINT BASED METHOD FOR UNCERTAINTY ANALYSIS , 2000 .