Abstract
This report presents an asynchronous, distributed genetic programming (GP) system using a master/slave architecture. Using symbolic regression for fourier functions as the problem domain, the system was found to demonstrate cooperative coevolutionary dynamics when multiple client populations evolve solutions to similar, but different problems: specifically, closely coupled populations were found to promote continuous search, which in some cases leads to the discovery of better solutions.
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
Braun, H. C.: On Solving Travelling Salesman Problems by Genetic Algorithms. In: Schwefel H.-P. & R. Männer (eds.): Parallel Problem Solving From Nature, pp. 129–133. Springer-Verlag, Berlin (1990).
Cantú-Paz, E.: Topologies, Migration Rates, and Multi-Population Parallel Genetic Algorithms. To Appear in: GECCO-99, Genetic and Evolutionary Computation Conference, July 13–17, Orlando FL (1999).
Cantú-Paz, E.: A Survey of Parallel Genetic Algorithms. In: Calculateurs Paralleles. 10:2 (1998).
Cantú-Paz, E. & D. Goldberg: Modelling Idealized Bounding Cases of Parallel Genetic Algorithms. In: Koza, J., K. Deb, M. Dorigo, D. Fogel, M. Garzon, H. Iba & R. Riolo (eds.): Genetic Programming 1997: Proceedings of the Second Annual Conference, pp. 353–361. Morgan Kauffman, San Francisco CA (1997).
Goldberg, D. E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Redwood City CA (1989).
Hillis, D. W.: Co-Evolving Parasites Improve Simulated Evolution as an Optimization Procedure. In: Langton, C. G., Taylor, C. (eds.): Artificial Life II, pp. 313–322. Addison-Wesley, Redwood City CA (1992).
Koza, J. R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge MA (1992).
Mahfoud, S. W.: A Comparison of Parallel and Sequential Niching Methods. In: ICGA 6, pp. 136–143. (1995).
Marin, F. J., O. Trelles-Salazar & F. Sandoval: Genetic Algorithms on LAN-message passing architectures using PVM: Application to the Routing Problem. In: Davidor, Y., H.-P. Schwefel & R. Männer (eds.): Parallel Problem Solving from Nature III, pp. 534–543. Springer-Verlag, Berlin (1994).
Munetomo, M., Y. Takai & Y. Sato: An Efficient Migration Scheme for Subpopulation-Based Asynchronously parallel genetic algorithms. In: Forrest, S. (ed.): Proceedings of the Fifth International Conference on Genetic Algorithms, p. 649. Morgan Kauffman, San Mateo CA (1993).
Miller, B. L. & M. J. Shaw: Genetic Algorithms with Dynamic Niche Sharing for Multimodal Function Optimization. In: IEEE International Conference on Evolutionary Computation, pp. 786–791. IEEE Press, Piscataway NJ (1996).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bongard, J.C. (1999). Coevolutionary Dynamics of a Multi-population Genetic Programming System. In: Floreano, D., Nicoud, JD., Mondada, F. (eds) Advances in Artificial Life. ECAL 1999. Lecture Notes in Computer Science(), vol 1674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48304-7_22
Download citation
DOI: https://doi.org/10.1007/3-540-48304-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66452-9
Online ISBN: 978-3-540-48304-5
eBook Packages: Springer Book Archive