Abstract
This paper presents a new proposal for reducing bloat in Genetic Programming. This proposal is based in a well-known parallel evolutionary model: the island model. We firstly describe the theoretical motivation for this new approach to the bloat problem, and then we present a set of experiments that gives us evidence of the findings extracted from the theory. The experiments have been performed on a representative problem extracted from the GP field: the even parity 5 problem. We analyse the evolution of bloat employing different settings for the parameters employed. The conclusion is that the Island Model helps to prevent the bloat phenomenon.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Papadopoulos, P.M., Katz, M.J., Bruno, G.: NPACI Rocks: Tools and Techniques for Easily Deploying Manageable Linux Clusters. In: Concurrency and Computation: Practice and Experience, June - July 2003, vol. 15(7-8), pp. 707–725 (2003)
Koza, J.R.: Genetic Programming. On the programming of computers by means of natural selection. The MIT Press, Cambridge (1992)
Langdom, W., Poli, R.: Fitness causes bloat. In: Chawdhry, P.K., et al. (eds.) Soft Computing in Engineering Design and Manufacturing, pp. 13–22. Springer, London (1997)
Banzhaf, W., Langdon, W.B.: Some Considerations on the Reason for Bloat. Genetic Programming and Evolvable Machines 3, 81-1 (2002)
Langdom, W.B., Poli, R.: Foundations of Genetic Programming. In: Convergence and bloat, pp. 193–217. Springer, Heidelberg (2001)
Langdon, W.B.: Quadratic Bloat in Genetic Programming. In: proceedings of the 2000 Genetic and Evolutionary Computation Conference (2000)
Fernández, F.: Parallel and Distributed Genetic Programming models, with application to logic synthesis on FPGAs, PhD Thesis. Universidad de Extremadura (February 2001)
Fernández, F., Tomassini, M., Vanneschi, L.: An Empirical Study of Multipopulation Genetic Programming. Genetic Programming and Evolvable Machines 4, 21–51 (2003)
Galeano, G., Fernández, F., Tomassini, M., Vanneschi, L.: Studying the Influence of Synchronous and Asynchronous Parallel GP on Programs Length Evolution. In: Proceedings of Conference on Evolutionary Computation (2002)
Cantú-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic PublishersISBN 0-7923-7221-2. vol. 1 of the Book Series on Genetic Algorithms and Evolutionary Computation
Punch, W.F.: How effective are multiple populations in Genetic Programming. Genetic Programming 1998. In: Koza, J.R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M., Goldberg, D., Iba, H., Riolo, R.L. (eds.) Proceedings of the Third Annual Conference, pp. 308–313. Morgan Kaufmann, San Francisco (1998)
Tomassini, M., Fernández, F., Vanneschi, L., Bucher, L.: An MPI-Based Tool for Distributed Genetic Programming. In: Proceedings of IEEE International Conference on Cluster Computing CLUSTER2000, pp. 209–216. IEEE Computer Society, Los Alamitos (2000)
Soule, T.: Exons and code growth in genetic programming. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 142–151. Springer, Heidelberg (2002)
Luke, S.: Modification Point Depth and Genome Growth in Genetic Programming. Evolutionary Computation 11(1), 67 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández-de-Vega, F., Gil, G.G., Gómez Pulido, J.A., Guisado, J.L. (2004). Control of Bloat in Genetic Programming by Means of the Island Model. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-30217-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23092-2
Online ISBN: 978-3-540-30217-9
eBook Packages: Springer Book Archive