A Constraint-Handling Technique for Decomposition-Based Constrained Many-Objective Evolutionary Algorithms
Top Cited Papers
- 16 August 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 53 (12) , 7783-7793
Abstract
To solve the constrained many-objective optimization problems (CMaOPs), the tradeoff among convergence, diversity, and feasibility is a crucial and challenging task. This article proposes a new constraint-handling technique tailored for decomposition-based many-objective evolutionary algorithms to deal with the CMaOPs effectively. Specifically, the proposed method, namely, constrained penalty boundary intersection (CPBI), is an improved aggregation function based on the penalty boundary intersection. In CPBI, the normalized overall constraint violation (CV) is embedded to pursue feasibility. In this way, by the optimization of CPBI, convergence, diversity, and feasibility can be optimized simultaneously. Furthermore, the weight of the normalized overall CV is adjusted adaptively based on the feasible ratio of the current population. To evaluate the performance of CPBI, it is combined with three decomposition-based algorithms. Ten benchmark problems with 50 instances are chosen as the test suite. In addition, the proposed method is compared with nine advanced algorithms. Experimental results have demonstrated the promising performance of CPBI for different problems.Keywords
Funding Information
- National Natural Science Foundation of China (62076225)
This publication has 54 references indexed in Scilit:
- MOEA/D with Adaptive Weight AdjustmentEvolutionary Computation, 2014
- A modified objective function method with feasible-guiding strategy to solve constrained multi-objective optimization problemsApplied Soft Computing, 2014
- An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box ConstraintsIEEE Transactions on Evolutionary Computation, 2013
- An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive ApproachIEEE Transactions on Evolutionary Computation, 2013
- KEEL: a software tool to assess evolutionary algorithms for data mining problemsSoft Computing, 2008
- An interactive fuzzy multi-objective optimization method for engineering designEngineering Applications of Artificial Intelligence, 2006
- The balance between proximity and diversity in multiobjective evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- A Tradeoff Cut Approach to Multiple Objective OptimizationOperations Research, 1980