Abstract
Evolutionary Computation (EC) introduces a new paradigm for solving problems in Artificial Intelligence, representing solution candidates as individuals and evolving them based on Darwin’s Theory of Natural Selection. Genetic Algorithms (GA) and Genetic Programming (GP), two important EC techniques, have been successfully applied both in theoretical scenarios and practical situations. This work discusses an issue of great relevance and impact on this type of algorithm: the automatic adjustment of the parameters that control the search process. Based on a recent research, a method that controls the population size in a GA is adapted and implemented in GP. A series of classic experiments has been performed before and after the modifications, showing that this method can improve the algorithms’ robustness and reliability. The data allow a discussion about the method and the importance of the adaptation of parameters in EC algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
BÄCK, T. Self-adaptation in genetic algorithms. In Proceedings of the First European Conference on Artificial Life (pp. 263–271). Cambridge USA: MIT Press, 1992.
BAGLEY, J. D. The behavior of adaptative systems which employ genetic and correlation algorithms. PhD Thesis. University of Michigan. 1967.
BANZHAF, W.; NORDIN, P. et al. Genetic programming, an introduction: on the automatic evolution of computer programs and its applications. Morgan Kaufinann, 1998.
DARWIN, C. On the origin of species by means of natural selection or the preservation of favored races in the struggle for life. London, UK: Murray, 1859.
DAVIS, L. Adapting operator probabilities in genetic algorithms. In Proceedings of the Third International Conference on Genetic Algorithms (pp. 61–69). San Mateo, USA: Morgan Kaufinann, 1989.
EIBEN, A.; HINTERDING, R.; MICHALEWICZ, Z. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation (vol. 3. pp. 124–141). IEEE, 1999.
GREFENSTETTE, J. J. Optimization of control parameters for genetic algorithms. SAGE, A. P.(Ed.). IEEE Transactions on Systems, Man and Cybernetics. SMC-16(1). pp. 122–128. New York, USA: IEEE, 1986.
HARIK, G.; LOBO, F. A parameter-less genetic algorithm. Technical report 99009, Illinois Genetic Algorithm Laboratory. Illinois, USA: 1999.
HOLLAND, J. H. Adaptation in natural and artificial systems. MIT Press, 1992.
JULSTROM, B. A. Adaptative operator probabilities in a genetic algorithm that applies three operators. In Proceedings of the 1997 ACM Symposium on Applied Computing. pp. 233–238. New York, USA: ACM Press, 1997.
KOCH, T.; SCHEER, V. et al. A parallel, hybrid meta optimization for finding better parameters of an evolution strategy in real world optimization problems. Proceedings of the Genetic and Evolutionary Computation Conference Workshop Program (pp. 17–19). Morgan Kaufinann, 2000.
KOZA, J. R. Genetic programming: on the programming of computers by means of natural selection. MIT Press, 1992.
KOZA, J. R. Genetic programming II: automatic discovery of reusable programs. MIT Press, 1994.
LANGDON, W.B.; POLI, R. Why ants are hard. Technical report CSRP-98-4. THE University of Birmingham. School of Computer Science. 1998.
LOBO, F. G. The parameter-less genetic algorithm: rational and automated parameter selection for simplified genetic algorithm operation. PhD Thesis. Universidade Nova de Lisboa. Faculdade de Ciências e Tecnologia. Lisboa: 2000.
MERCER, R. E.; SAMPSON, J. R. Adaptative search using a reproductive meta-plan. Kybernetes. 7. pp. 215–228. 1978.
MITCHELL, M. An introduction to genetic algorithms. MIT Press, 1996.
SMITH, R. E.; SMUDA, E. Adaptively resizing populations: algorithm, analysis, and first results. Complex Systems (vol. 9 pp. 47–72). 1996.
SPINOSA, E. Adaptação dinâmica de parâmetras em Computação Evolucionária: o controle do tamanho da população em um sistema de Programação Genética. MSc Dissertation. Federal University of Paraná. Computer Science Department. Curitiba, Brazil, 2002.
ZONGKER, D.; PUNCH, B. Lil-gp 1.01 user’s manual. Michigan State University. http://garage.cps.msu.edu/software/lil-gp/lilgp-index.html.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spinosa, E., Pozo, A. (2002). Controlling the Population Size in Genetic Programming. In: Bittencourt, G., Ramalho, G.L. (eds) Advances in Artificial Intelligence. SBIA 2002. Lecture Notes in Computer Science(), vol 2507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36127-8_33
Download citation
DOI: https://doi.org/10.1007/3-540-36127-8_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00124-9
Online ISBN: 978-3-540-36127-5
eBook Packages: Springer Book Archive