A survey of penalty techniques in genetic algorithms
Mitsuo Gen, Runwei Cheng · 2002
The penalty technique is perhaps the most common technique used in the genetic algorithms for constrained optimization problems. In recent years, several techniques have been proposed in the area of evolutionary computation. However, there is no general guideline on designing penalty functions, and constructing an efficient penalty function is quite problem-dependent. This paper gives a tutorial survey of recent works on penalty techniques used in genetic algorithms and gives a better classification of existing works, which may be helpful for revealing the intrinsic relationship among them and for providing some hints for further studies on penalty techniques.