Efficient Constraint Handling based on the Adaptive Penalty Method with Balancing the Objective Function Value and the Constraint Violation
Authors:
- 1 November 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 121-128
Abstract
Real world problems are often formularized as constrained optimization problems (COPs). Constraint handling techniques are important for efficient search, and various approaches such as penalty methods or feasibility rules have been studied. The penalty methods deal with a single fitness function by combining the objective function value and the constraint violation with a penalty factor. Moreover, the penalty factor can be flexibly adapted by feeding back information on search process in adaptive penalty methods. However, keeping the good balance between the objective function value and the constraint violation is very difficult. In this paper, we propose a new adaptive penalty method with balancing the objective function value and the constraint violation and examine its effectiveness. L-SHADE is adopted as a base algorithm to evaluate search performance, and the optimization results of 28 benchmark functions provided by the CEC 2017 competition on constrained single-objective numerical optimizations are compared with other methods. In addition, we also examine the behavioral difference between proposed method and the conventional adaptive penalty method.Keywords
This publication has 9 references indexed in Scilit:
- Constraint-Handling Techniques used with Evolutionary Algorithms2016
- A review on constraint handling strategies in particle swarm optimisationNeural Computing and Applications, 2015
- Improving the search performance of SHADE using linear population size reduction2014
- ASCHEA: new results using adaptive segregational constraint handling2003
- An efficient constraint handling method for genetic algorithmsComputer Methods in Applied Mechanics and Engineering, 2000
- A Genetic Algorithm for the Multiple-Choice Integer ProgramOperations Research, 1997
- Penalty guided genetic search for reliability design optimizationComputers & Industrial Engineering, 1996
- Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial ProblemsINFORMS Journal on Computing, 1996
- A Collection of Test Problems for Constrained Global Optimization Algorithms1990