A bi-objective hybrid constrained optimization (HyCon) method using a multi-objective and penalty function approach

Single objective evolutionary constrained optimization has been widely researched by plethora of researchers in the last two decades whereas multi-objective constraint handling using evolutionary algorithms has not been actively proposed. However, real-world multi-objective optimization problems consist of one or many non-linear and non-convex constraints. In the present work, we develop an evolutionary algorithm based on hybrid constraint handling methodology (HyCon) to deal with constraints in bi-objective optimization problems. HyCon is a combination of an Evolutionary Multi-objective Optimization (EMO) coupled with classical weighted sum approach and is an extended version of our previously developed constraint handling method for single objective optimization. A constrained bi-objective problem is converted into a tri-objective problem where the additional objective is formed using summation of constrained violation. The performance of HyCon is tested on four constrained bi-objective problems. The non-dominated solutions are compared with a standard evolutionary multi-objective optimization algorithm (NSGA-II) with respect to hypervolume and attainment surface. The simulation results illustrates the effectiveness of the HyCon method. The HyCon either outperformed or produced similar performance as compared to NSGA-II.

[1]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[2]  Yuping Wang,et al.  An infeasible Elitist Based Particle Swarm Optimization for Constrained Multiobjective Optimization and its Convergence , 2010, Int. J. Pattern Recognit. Artif. Intell..

[3]  Nicholas Young,et al.  Blended Ranking to Cross Infeasible Regions in ConstrainedMultiobjective Problems , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

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

[5]  Andres Angantyr,et al.  Constrained optimization based on a multiobjective evolutionary algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[6]  K. Deb,et al.  A bi-objective constrained optimization algorithm using a hybrid evolutionary and penalty function approach , 2013 .

[7]  Bishakh Bhattacharya,et al.  Practical Applications in Constrained Evolutionary Multi-objective Optimization , 2017, Recent Advances in Evolutionary Multi-objective Optimization.

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

[9]  Rituparna Datta,et al.  A surrogate-assisted evolution strategy for constrained multi-objective optimization , 2016, Expert Syst. Appl..

[10]  A.F. Gomez-Skarmeta,et al.  An evolutionary algorithm for constrained multi-objective optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

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

[13]  Kalyanmoy Deb,et al.  An adaptive normalization based constrained handling methodology with hybrid bi-objective and penalty function approach , 2012, 2012 IEEE Congress on Evolutionary Computation.