Constrained multi-objective optimization using constrained non-dominated sorting combined with an improved hybrid multi-objective evolutionary algorithm

ABSTRACT Constrained multi-objective optimization problems (cMOPs) are complex because the optimizer should balance not only between exploration and exploitation, but also between feasibility and optimality. This article suggests a parameter-free constraint handling approach called constrained non-dominated sorting (CNS). In CNS, each solution in a population is assigned a constrained non-dominated rank based on its constraint violation degree and Pareto rank. An improved hybrid multi-objective optimization algorithm called cMOEA/H for solving cMOPs is proposed. Additionally, a dynamic resource allocation mechanism is adopted by cMOEA/H to spare more computational efforts for those relatively hard sub-problems. cMOEA/H is first compared with the baseline algorithm using an existing constraint handling mechanism, verifying the advantages of the proposed constraint handling mechanism. Then cMOEA/H is compared with some classic constrained multi-objective optimizers, experimental results indicating that cMOEA/H could be a competitive alternative for solving cMOPs. Finally, the characteristics of cMOEA/H are studied.

[1]  Alice E. Smith,et al.  Penalty functions , 1996 .

[2]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[3]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[4]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

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

[6]  Carlos Artemio Coello-Coello,et al.  Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art , 2002 .

[7]  Kaisa Miettinen,et al.  Numerical Comparison of Some Penalty-Based Constraint Handling Techniques in Genetic Algorithms , 2003, J. Glob. Optim..

[8]  C.-Y. Lin,et al.  Self-organizing adaptive penalty strategy in constrained genetic search , 2004 .

[9]  Tetsuyuki Takahama,et al.  Constrained optimization by applying the /spl alpha/ constrained method to the nonlinear simplex method with mutations , 2005, IEEE Transactions on Evolutionary Computation.

[10]  Tetsuyuki Takahama,et al.  Constrained Optimization by epsilon Constrained Particle Swarm Optimizer with epsilon-level Control , 2005, WSTST.

[11]  Ozgur Yeniay.  Penalty Function Methods for Constrained Optimization with Genetic Algorithms , 2005 .

[12]  M Reyes Sierra,et al.  Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art , 2006 .

[13]  Elmer P. Dadios,et al.  Genetic algorithm with adaptive and dynamic penalty functions for the selection of cleaner production measures: a constrained optimization problem , 2006 .

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

[15]  Qingfu Zhang,et al.  The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances , 2009, 2009 IEEE Congress on Evolutionary Computation.

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

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

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

[19]  Carlos A. Coello Coello,et al.  HCS: A New Local Search Strategy for Memetic Multiobjective Evolutionary Algorithms , 2010, IEEE Transactions on Evolutionary Computation.

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

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

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

[23]  Muhammad Asif Jan,et al.  A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D , 2013, Appl. Soft Comput..

[24]  M. M. Ali,et al.  A penalty function-based differential evolution algorithm for constrained global optimization , 2012, Computational Optimization and Applications.

[25]  Yang Xiaofei,et al.  A Self-adaptive Interior Penalty Based Differential Evolution Algorithm for Constrained Optimization , 2014, ICSI.

[26]  J. Zhuang,et al.  A computational study on different penalty approaches for solving constrained global optimization problems with the electromagnetism-like method , 2014 .

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

[28]  Qingfu Zhang,et al.  Decomposition of a Multiobjective Optimization Problem Into a Number of Simple Multiobjective Subproblems , 2014, IEEE Transactions on Evolutionary Computation.

[29]  Qingfu Zhang,et al.  An External Archive Guided Multiobjective Evolutionary Algorithm Based on Decomposition for Combinatorial Optimization , 2015, IEEE Transactions on Evolutionary Computation.

[30]  N. Hansen,et al.  Markov Chain Analysis of Cumulative Step-Size Adaptation on a Linear Constrained Problem , 2015, Evolutionary Computation.

[31]  Qingfu Zhang,et al.  Are All the Subproblems Equally Important? Resource Allocation in Decomposition-Based Multiobjective Evolutionary Algorithms , 2016, IEEE Transactions on Evolutionary Computation.

[32]  Qingfu Zhang,et al.  Adaptive Replacement Strategies for MOEA/D , 2016, IEEE Transactions on Cybernetics.

[33]  Gara Miranda,et al.  Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization , 2016, Ann. Oper. Res..