Numerical Comparison of Some Penalty-Based Constraint Handling Techniques in Genetic Algorithms |
| |
Authors: | Kaisa Miettinen Marko M. Mäkelä Jari Toivanen |
| |
Affiliation: | (1) Department of Mathematical Information Technology, University of Jyväskylä, Finland, P.O. Box 35 (Agora), FIN-40014 |
| |
Abstract: | We study five penalty function-based constraint handling techniques to be used with genetic algorithms in global optimization. Three of them, the method of superiority of feasible points, the method of parameter free penalties and the method of adaptive penalties have already been considered in the literature. In addition, we introduce two new modifications of these methods. We compare all the five methods numerically in 33 test problems and report and analyze the results obtained in terms of accuracy, efficiency and reliability. The method of adaptive penalties turned out to be most efficient while the method of parameter free penalties was the most reliable. |
| |
Keywords: | constrained optimization genetic algorithms global optimization penalty functions |
本文献已被 SpringerLink 等数据库收录! |