Abstract
Most applications of genetic algorithms (GAs) in handling constraints use a straightforward penalty function method. Such techniques involve penalty parameters which must be set right in order for GAs to work. Although many researchers use adaptive variation of penalty parameters and penalty functions, the general conclusion is that these variations are specific to a problem and cannot be generalized. In this paper, we propose a niched-penalty approach which does not require any penalty parameter. The penalty function creates a selective pressure towards the feasible region and a niching maintains diversity among feasible solutions for the genetic recombination operator to find new feasible solutions. The approach is only ap plicable to population-based approaches, thereby giving GAs (or other evolutionary algorithms) a niche in exploiting this penalty-parameter-less penalty approach.Simulation results on a number of constrained optimization problems suggest the efficacy of the proposed method.
An Alexander von Humboldt Fellow.
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
Deb, K.: Optimal design of a welded beam structure via genetic algorithms, AIAA Journal, vol. 29, no. 11, pp. 2013–2015,1991.
Deb, K.: Optimization for engineering design: Algorithms and examples. New Delhi: Prentice-Hall 1995.
Deb, K., Agrawal, R. B.: Simulated binary crossover for continuous search space. Complex Systems, vol. 9, pp. 115–148,1995.
Deb, K., Goldberg, D. E.: An investigation of niche and species formation in genetic function optimization, Proc. Third International Conference on Genetic Algorithms, Washington D. C, pp. 42–50, 1989.
Deb, K., Goyal, M.: A combined genetic adaptive search (GeneAS) for engineering design, Computer Science and Informatics, vol. 26, no. 4, pp. 30–45, 1996.
Goldberg, D. E., Deb, K., Clark, J. H.: Genetic algorithms, noise, and the sizing of populations, Complex Systems, vol. 6, pp. 333–362, 1992.
Harik, G., Cantu-Paz, E., Goldberg, D. E., Miller, B. L.: The gambler’s ruin problem, genetic algorithms, and the sizing of populations, Proc. 1997 IEEE International Conference on Evolutionary Computation, Orlando, FL, pp. 7–12, 1997.
Himmelblau, D. M.: Applied nonlinear programming, New York: McGraw-Hill, 1972.
Hock, W., Schittkowski, K.: Test examples for nonlinear programming code, Lecture Notes on Economics and Mathematical Systems, 187, Berlin: Springer-Verlag, 1980.
Homaifar, A., Lai, S. H.-Y., Qi., X.: Constrained optimization via genetic algorithms, Simulation, vol. 62, no. 4, 242–254, 1994.
Joines, J. A., Houck, C. R.: On the use of nonstation-ary penalty functions to solve nonlinear constrained optimization problems with GAs, Proc International Conference on Evolutionary Computation, Orlando, FL, pp. 579–584, 1994.
Michalewicz, Z.: Genetic algorithms, numerical optimization, and constraints, Proc. Sixth International Conference on Genetic Algorithms, Carnegie-Mellon, PA, pp. 151–158,1995.
Michalewicz, Z., Attia, N.: Evolutionary optimization of constrained problems, Proc. Third Annual Conference on Evolutionary Programming, pp. 98–108,1994.
Michalewicz, Z., Schoenauer, M.: Evolutionary algorithms for constrained parameter optimization problems, Evolutionary Computation, vol. 4, no. 1, pp. 1–32, 1996.
Powell, D., Skolnick, M. M.: Using genetic algorithms in engineering design optimization with nonlinear constraints, Proc. Fifth International Conference on Genetic Algorithms, Urbana, IL, pp. 424–430,1993.
Reklaitis, G. V, Ravindran, A., Ragsdell, K. M.: Engineering optimization methods and applications, New York: Wiley, 1983.
Richardson, J. T., Palmer, M. R., Liepins, G., Hilliard, M: Some guidelines for genetic algorithms with penalty functions, Proc. Third International Conference on Genetic Algorithms, Washington D. C, pp. 191–197,1989.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Wien
About this paper
Cite this paper
Deb, K., Agrawal, S. (1999). A Niched-Penalty Approach for Constraint Handling in Genetic Algorithms. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6384-9_40
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6384-9_40
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83364-3
Online ISBN: 978-3-7091-6384-9
eBook Packages: Springer Book Archive