Abstract
With the exception of a small body of adaptive-parameter literature, evolutionary computation has traditionally favored keeping the population size constant through the course of the run. Unfortunately, genetic programming has an aging problem: for various reasons, late in the run the technique become less effective at optimization. Given a fixed number of evaluations, allocating many of them late in the run may thus not be a good strategy. In this paper we experiment with gradually decreasing the population size throughout a genetic programming run, in order to reallocate more evaluations to early generations. Our results show that over four problem domains and three different numbers of evaluations, decreasing the population size is always as good as, and frequently better than, various fixed-sized population strategies.
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
Streeter, M.J., Keane, M.A., Koza, J.R.: Iterative refinement of computational circuits using Genetic Programming. In Langdon, W.B., Cantú-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M.A., Schultz, A.C., Miller, J.F., Burke, E., Jonoska, N., eds.: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, Morgan Kaufmann Publishers (2002) 877–884
Koza, J.R., Keane, M.A., Yu, J., Mydlowec, W.: Automatic synthesis of electrical circuits containing a free variable using Genetic Programming. In Whitley, D., Goldberg, D., Cantu-Paz, E., Spector, L., Parmee, I., Beyer, H.G., eds.: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), Las Vegas, Nevada, USA, Morgan Kaufmann (2000) 477–484
Koza, J.: Genetic Programming: on the Programming of Computers by Means of Natural Selection. MIT Press (1992)
Luke, S.: When short runs beat long runs. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO) 2001, Morgan Kaufmann Publishers (2001) 74–80
De Jong, K.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Ann Arbor, MI (1975)
Grefenstette, J.J.: Optimization of control parameters for Genetic Algorithms. IEEE Transactions on Systems Man and Cybernetics 16 (1986) 122–128
Schaffer, J.D., Caruana, R.A., Eshelman, L.J., Das, R.: A study of control parameters affecting online performance of Genetic Algorithms for function optimization. In: Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann Publishers Inc. (1989) 51–60
De Jong, K., Spears, W.M.: An analysis of the interacting roles of population size and crossover in Genetic Algorithms. In Schwefel, H.P., Männer, R., eds.: Parallel Problem Solving from Nature-Proceedings of 1st Workshop, PPSN 1. Volume 496., Dortmund, Germany, Springer-Verlag, Berlin, Germany (1991) 38–47
Goldberg, D.E., Deb, K., Clark, J.H.: Genetic Algorithms, noise, and the sizing of populations. Complex Systems 6 (1992) 333–362
Giguère, P., Goldberg, D.E.: Population sizing for optimum sampling with Genetic Algorithms: A case study of the onemax problem. In Koza, J.R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M.H., Goldberg, D.E., Iba, H., Riolo, R., eds.: Genetic Programming 1998: Proceedings of the Third Annual Conference, University of Wisconsin, Madison, Wisconsin, USA, Morgan Kaufmann (1998) 496–503
Federman, F., Dorchak, S.F.: A study of classifier length and population size. In Koza, J.R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M.H., Goldberg, D.E., Iba, H., Riolo, R., eds.: Genetic Programming 1998: Proceedings of the Third Annual Conference, University of Wisconsin, Madison, Wisconsin, USA, Morgan Kaufmann (1998) 629–634
Arabas, J., Michalewicz, Z., Mulawka, J.J.: GAVaPS — A Genetic Algorithm with varying population size. In: Proceedings of IEEE Conference on Evolutionary Computation. Volume 1. (1994) 73–78
Balazs, M.E., Richter, D.L.: A Genetic Algorithm with dynamic population: Experimental results. In Brave, S., Wu, A.S., eds.: Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference, Orlando, Florida, USA (1999) 25–30
Fuchs, M.: Large populations are not always the best choice in Genetic Programming. In Banzhaf, W., Daida, J., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M., Smith, R.E., eds.: Proceedings of the Genetic and Evolutionary Computation Conference. Volume 2., Orlando, Florida, USA, Morgan Kaufmann (1999) 1033–1038
Wagner, N., Michalewicz, Z.: Genetic Programming with efficient population control for financial time series prediction. In Goodman, E.D., ed.: 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers, San Francisco, California, USA (2001) 458–462
Luke, S. ECJ 9: A Java EC research system. http://www.cs.umd.edu/projects/plus/ec/ecj/ (2002)
Cervone, G., Michalski, R., Kaufman, K., Panait, L.: Combining Machine Learning with Evolutionary Computation: Recent results on LEM. In: Proceedings of the Fifth International Workshop on Multistrategy Learning. (2000) 41–58
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luke, S., Balan, G.C., Panait, L. (2003). Population Implosion in Genetic Programming. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_65
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive