Abstract
In this paper the relative performance of two constraint handling techniques, namely a parameter-less adaptive penalty method (APM) and the stochastic ranking method (SR), is studied in the context of continuous parameter constrained optimization problems. Both techniques are used within the same search engine, a binary-coded genetic algorithm. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Barbosa, H. J. C., Lemonge, A. C. C., Fonseca, L. G., & Bernardino, H. S. (2010). Comparing two constraint handling techniques in a binary-coded genetic algorithm for optimization problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6457 LNCS, pp. 125–134). https://doi.org/10.1007/978-3-642-17298-4_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
