Abstract
This research aims to develop effective and robust self-organizing adaptive penalty strategies (SOAPS and SOAPSe) for genetic algorithms to handle constrained optimization problems without the need of searching for proper values of penalty factors for a given optimization problem in hand. The proposed strategies are based on the idea that the constrained optimal design is almost always located at the boundary between feasible and infeasible domains. Both adaptive penalty strategies automatically adjust the value of the penalty parameter used for each of the constraints according to the ratio between the number of designs violating the specific constraint and the number of designs satisfying the constraint. The goal is to maintain equal numbers of design in each side of the constraint boundary so that the chance of locating their offspring designs around the boundary is maximized. Illustrative examples showed consistently improved performance on locating the global optimum in the problem with only inequality constraints and in the problem with both inequality and equality constraints.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Holland, J. H., Adaptation in Natural and Artificial System, University of Michigan Press, 1975
Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989
Gen, M. and Cheng, R., Genetic Algorithms and Engineering Design, John Wiley & Sons, 1996
Michalewicz, Z. and Schoenauer, M., Evolutionary Algorithms for Constrained Parameter Optimization Problems, Evolutionary Computation, Vol.4, No.1, 1996, pp.1–32.
Michalewicz, Z., Genetic Algorithms, Numerical Optimization and Constraints, Proceedings of the 6th International Conference on Genetic Algorithms, Morgan Kaufmann, 1995, pp.151–158
Gen, M. and Cheng, R., A Survey of Penalty Techniques in Genetic Algorithms, Proceedings of IEEE International Conference on Evolutionary Computation, 1996, pp.804–809.
Lin, C.-Y. and Hajela, P., Genetic Algorithms in Optimization Problems with Discrete and Integer Design Variables, Engineering Optimization, Vol. 19, No.3, 1992, pp.309–27.
Joines, J. and Houck, C., On the Use of Non-stationary Penalty Functions to Solve Nonlinear Constrained Optimization Problems with GAs, Proceedings of the First IEEE Conference on Evolutionary Computation, 1994, pp.579–84.
Hock, W. and Schittkowski, K., Test Examples for Nonlinear Programming Codes, 187, Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, 1981
Floudas, C.A. and Pardalos, P.M., A collection of test problems for constrained global optimization algorithms, Springer-Verlag, 1990
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this paper
Cite this paper
Lin, CY., Wu, WH. (2004). Adaptive Penalty Strategies in Genetic Search for Problems with Inequality and Equality Constraints. In: Burczyński, T., Osyczka, A. (eds) IUTAM Symposium on Evolutionary Methods in Mechanics. Solid Mechanics and Its Applications, vol 117. Springer, Dordrecht. https://doi.org/10.1007/1-4020-2267-0_23
Download citation
DOI: https://doi.org/10.1007/1-4020-2267-0_23
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2266-1
Online ISBN: 978-1-4020-2267-8
eBook Packages: Springer Book Archive