Abstract
The parallel execution of several populations in evolutionary algorithms has usually given good results. Nevertheless, researchers have to date drawn conflicting conclusions when using some of the parallel genetic programming models. One aspect of the conflict is population size, since published GP works do not agree about whether to use large or small populations. This paper presents an experimental study of a number of common GP test problems. Via our experiments, we discovered that an optimal range of values exists. This assists us in our choice of population size and in the selection of an appropriate parallel genetic programming model. Finding efficient parameters helps us to speed up our search for solutions. At the same time, it allows us to locate features that are common to parallel genetic programming and the classic genetic programming technique.
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
Paz, C., Goldberg, D.: Predicting Speedups of Ideal Bounding Cases of Parallel Genetic Algorithms. In: Proceedings of the Seventh International Conference on Genetic Algorithms. Morgan Kaufmann, San Francisco
Whitley, D., Rana, S., Heckendorn, R.B.: Island Model Genetic Algorithms and Linearly Sparable Problems. In: Proceedings of the AISB Workshop on Evolutionary Computation
Corne, D., Shapiro, J.L. (eds.): pp. 109–125. Springer, Berlin (1997)
Andre, D., Koza, J.: Parallel Genetic Programming: A Scalable Implementation Using the Transputer Network Architecture. In: Advances in Genetic Programming, vol. 2. The MIT Press, Cambridge
Fuchs, M.: Large Populations are not always the best choice in Genetic Programming. In: Proceedings of the Genetic and Evolutionary Computation Conference GECCO 1999 (1999)
Punch, W.F.: How effective are multiple populations in Genetic Programming. In: Koza, J.R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogela, D.B., Garzon, M., Goldberg, D., Iba, F., Riolo, R.L. (eds.) Genetic Programming 1998: Proceedings of the Third Annual Conference, pp. 308–313. Morgan Kaufmann, San Francisco (1998)
Arnone, S., Dell’Orto, M., Tettamanzi, A., Tomassini, M.: Highly Parallell Evolutionary Algorithms for Global Optimization, Symbolic Inference and Non- Linear Regression. In: Proceedings of the 6th Joint EPS-APS International Conference on Physics Computing (1994)
Oussaidene, M., Chopard, B., Pictet, O.V., Tomassini, M.: Parallel Genetic Programming and its application to trading model induction. Parallel Computing 23, 1183–1198 (1997)
Lin, S.-C., Punch, W.F., Goodman, E.D.: Coarse-grain Genetic Algorithms, Categorization and New Approaches. In: Sixth IEEE Parallel and Distributed Processing, October 1994, pp. 28–37 (1994)
Weinbrenner, T.: Genetic Programming Kernel Version 0.5.2 C++ Class Library, http://thor.emk.e-technik.th-darmstadt.de/~thomasw/gpkernell.html
Fernández, F., Sánchez, J.M., Tomassini, M., Gómez, J.A.: A parallel Genetic Programming Tool Based on PVM. In: Dongarra, J., Luque, E., Margalef, T. (eds.) Recent Advances in Parallel Virtual Machine and Message Passing Interface, Springer, Heidelberg
Sunderman, V.S.: PVM: A Framework for Parallel Distributed Computing. Journal of Concurrency: Practice and Experience, 315–339 (December 1990)
Koza, J.: Genetic Programming II. The MIT Press, Cambridge
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
Fernández, F., Tomassini, M., Punch, W.F., Sánchez, J.M. (2000). Experimental Study of Multipopulation Parallel Genetic Programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds) Genetic Programming. EuroGP 2000. Lecture Notes in Computer Science, vol 1802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46239-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-46239-2_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67339-2
Online ISBN: 978-3-540-46239-2
eBook Packages: Springer Book Archive