Abstract
Adaptivity has become a key issue in Evolutionary Algorithms, since early works in Evolution Strategies. The idea of letting the algorithm adjust its own parameters for free is indeed appealing. This paper proposes to use adaptive mechanisms at the population level for constrained optimization problems in three important steps of the evolutionary algorithm: First, an adaptive penalty function takes care of the penalty coefficients according to the proportion of feasible individuals in the current population; Second, a Seduction/Selection strategy is used to mate feasible individuals with infeasible ones and thus explore the region around the boundary of the feasible domain; Last, selection is tuned to favor a given number of feasible individuals. A detailed discussion of the behavior of the algorithm on two small constrained problems enlights adaptivity at work. Finally, experimental results on eleven test cases from the literature demonstrate the power of this approach.
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
T. Bäck, F. Hoffmeister, and H.-P. Schwefel. A survey of evolution strategies. In R. K. Belew and L. B. Booker, editors, Proc of the 4 th Int Conf on Genetic Algorithms, pages 2–9. Morgan Kaufmann, 1991.
A. B. Hadj-Alouane and J. C. Bean. A genetic algorithm for the multiple-choice integer program. Technical Report TR 92-50, Department of Industrial and Operations Engineering, The University of Michigan, 1992.
R. Hinterding, Z. Michalewicz, and A. E. Eiben. Adaptation in evolutionary computation: A survey. In T. Bäck, Z. Michalewicz, and X. Yao, editors, Proc of the Fourth IEEE Int Conf on Evolutionary Computation, pages 65–69. IEEE Press, 1997.
A. Homaifar, S. H.-Y. Lai, and X. Qi. Constrained optimization via genetic algorithms. Simulation, 62(4):242–254, 1994.
J.A. Joines and C.R. Houck. On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GAs. In Z. Michalewicz, J. D. Schaffer, H.-P. Schwefel, D. B. Fogel, and H. Kitano, editors, Proc of the First IEEE Int Conf on Evolutionary Computation, pages 579–584. IEEE Press, 1994.
S. Koziel and Z. Michalewicz. Evolutionary algorithms, homomorphous mapping and constrained parameter optimization. Evolutionary Computation, 7(1):19–44, 1999.
R. G. Leriche, C. Knopf-Lenoir, and R. T. Haftka. A segragated genetic algorithm for constrained structural optimization. In L. J. Eshelman, editor, Proc of the 6 th Int Conf on Genetic Algorithms, pages 558–565, 1995.
Z. Michalewicz and N. Attia. Evolutionary optimization of constrained problems. In Proc of the 3 rd Annual Conf on Evolutionary Programming, pages 98–108. World Scientific, 1994.
Z. Michalewicz and C. Z. Janikow. Handling constraints in genetic algorithms. In R. K. Belew and L. B. Booker, editors, Proc of the 4 th Int Conf on Genetic Algorithms, pages 151–157. Morgan Kaufmann, 1991.
Z. Michalewicz and M. Schoenauer. Evolutionary Algorithms for Constrained Parameter Optimization Problems. Evolutionary Computation, 4(1):1–32, 1996.
D. Powell and M. M. Skolnick. Using genetic algorithms in engineering design optimization with non-linear constraints. In S. Forrest, editor, Proc of the 5 th Int Conf on Genetic Algorithms, pages 424–430. Morgan Kaufmann, 1993.
E. Ronald. When selection meets seduction. In L. J. Eshelman, editor, Proc of the 6 th Int Conf on Genetic Algorithms, pages 167–173. Morgan Kaufmann, 1995.
M. Schoenauer and Z. Michalewicz. Boundary operators for constrained parameter optimization problems. In Th. Bäeck, editor, Proc of the 7 th Int Conf on Genetic Algorithms, pages 322–329. Morgan Kaufmann, 1997.
H.-P. Schwefel. Numerical Optimization of Computer Models. John Wiley & Sons, New-York, 1981. 1995-2nd edition.
A. Smith and D. Tate. Genetic optimization using a penalty function. In S. Forrest, editor, Proc of the 5 th Int Conf on Genetic Algorithms, pages 499–503. Morgan Kaufmann, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben Hamida, S., Schoenauer, M. (2000). An Adaptive Algorithm for Constrained Optimization Problems. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_52
Download citation
DOI: https://doi.org/10.1007/3-540-45356-3_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41056-0
Online ISBN: 978-3-540-45356-7
eBook Packages: Springer Book Archive