Skip to main content
SpringerLink
Log in

An Empirical Study of Multipopulation Genetic Programming

  • Published:
Genetic Programming and Evolvable Machines Aims and scope Submit manuscript

Abstract

This paper presents an experimental study of distributed multipopulation genetic programming. Using three well-known benchmark problems and one real-life problem, we discuss the role of the parameters that characterize the evolutionary process of standard panmictic and parallel genetic programming. We find that distributing individuals between subpopulations offers in all cases studied here an advantage both in terms of the quality of solutions and of the computational effort spent, when compared to single populations. We also study the influence of communication patterns such as the communication topology, the number of individuals exchanged and the frequency of exchange on the evolutionary process. We empirically show that the topology does not have a marked influence on the results for the test cases studied here, while the frequency and number of individuals exchanged are related and there exists a suitable range for those parameters which is consistently similar for all the problems studied.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Andre and J. R. Koza, “Parallel genetic programming: A scalable implementation using the transputer network architecture,” in Advances in Genetic Programming 2, P. Angeline and K. Kinnear (eds.), MIT Press: Cambridge, MA, 1996, pp. 317–337.

    Google Scholar 

  2. T. Bäck, Evolutionary Algorithms in Theory and Practice, Oxford University Press: Oxford, 1996.

    Google Scholar 

  3. W. Banzhaf, Banscherus, and Dittrich, Hierarchical Genetic Programming Using Local Modules, Technical Report No. 56/99, SFB 531, University of Dortmund, Dortmund, Germany, 1999.

    Google Scholar 

  4. M. Brameier and W. Banzhaf, “A comparison of linear genetic programming and neural networks in medical data mining”, IEEE Transactions on Evolutionary Computation vol. 5(1), pp. 17–26, 2001.

    Google Scholar 

  5. E. Cantú -Paz. Efficient and Accurate Parallel Genetic Algorithms, Boston: Kluwer Academic Publishers, 2000.

    Google Scholar 

  6. E. Cantú -Paz and D. E. Goldberg. “Modeling idealized bounding cases of parallel genetic algorithms,” in Genetic Programming 1997: Proceedings of the Second Annual Conference, J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo (eds.), Morgan Kaufmann: San Francisco, CA, 1997, pp. 456–462.

    Google Scholar 

  7. B. Chopard, O. Pictet, and M. Tomassini, “Parallel and distributed evolutionary computation for financial applications,” Parallel Algorithms and Applications vol. 15, pp. 15–36, 2000.

    Google Scholar 

  8. M. Clergue, P. Collard, M. Tomassini, and L. Vanneschi, “Fitness distance correlation and problem difficulty for genetic programming,” in Proceedings of the Genetic and Evolutionary Computation Conference GECCO 02, Morgan Kaufmann: San Francisco, CA, 2002, pp. 724–732.

    Google Scholar 

  9. J. P. Cohoon, S. U. Hegde, W. N. Martin, and D. Richards, “Punctuated equilibria: A parallel genetic algorithm,” in Proceedings of the Second International Conference on Genetic Algorithms, J. J. Grefenstette (ed.), Lawrence Erlbaum Associates, 1987, p. 148.

  10. A. E. Eiben and M. Jelasity, “A critical note on experimental research methodology in EC,” in Proceedings of the 2002 Congress on Evolutionary Computation (CEC'2002) IEEE Press, Piscataway, NJ, 2002, pp. 582–587.

    Google Scholar 

  11. F. Fernández, Distributed Genetic Programming Models with Application to Logic Synthesis on FPGAs, Ph.D. Thesis, Computer Science Department, University of Extremadura, Cáceres, Spain, 2001.

    Google Scholar 

  12. F. Fernández, L. M. Roa, M. Tomassini, and J. M. Sánchez, “Multipopulation genetic programming applied to burn diagnosis,” in Congress on Evolutionary Computation (CEC 2000), IEEE Press, Piscataway, NJ, 2000, pp. 1292–1296.

    Google Scholar 

  13. F. Fernández, J. M. Sánchez, and M. Tomassini, Placing and routing circuits on FPGAs by means of parallel and distributed genetic programming, in Evoluable Systems: from Biology to Hardware, 4th International Conference, Ices 2001, vol. 2210 of Lecture Notes in Computer Science, Y. Liu, K. Tanaka, M. Iwata, T. Higuchi, and M. Yasunaga, (eds.), Springer-Verlag: Heidelberg, 2001, pp. 204–215.

    Google Scholar 

  14. F. Fernández, M. Tomassini, W. F. Punch III, and J. M. Sánchez, “Experimental study of multipopulation parallel genetic programming,” in Genetic Programming, Proceedings of EuroGP'2000, vol. 1802 of Lecture Notes in Computer Science, R. Poli, W. Banzhaf, W. B. Langdon, J. F. Miller, P. Nordin, and T. C. Fogarty (eds.), Springer-Verlag, 2000, pp. 283–293.

  15. F. Fernandez, M. Tomassini, and J. M. Sanchez, “Experimental study of isolated multipopulation genetic programming,” in IEEE International Conference on Industrial Electronics, Control and Instrumentation, Nagoya, Japan,IEEE Press: Piscataway, NJ, 2000, pp. 2672–2677.

    Google Scholar 

  16. F. Fernández, M. Tomassini, L. Vanneschi, and L. Bucher, “A distributed computing environment for genetic programming using MPI,” in Recent Advances in Parallel Virtual Machine and Message Passing Interface, vol. 1908 of Lecture Notes in Computer Science, J. Dongarra, P. Kaksuk, and N. Podhorszki (eds.), Springer-Verlag: Heidelberg, 2000, pp. 322–329.

    Google Scholar 

  17. Message Passing Interface Forum, “MPI: A message-passing interface standard,” International Journal of Supercomputer Applications, vol. 8(3–4), pp. 165–414, 1994.

    Google Scholar 

  18. M. Fuchs, “Large populations are not always the best choice in genetic programming,” in Proceedings of the Genetic and Evolutionary Computation Conference GECCO'99, W. Banzhaf, J. Daida, A. E. Eiben, M. Garzon, V. Honavar, M. Jakiela, and R. Smith (eds.), Morgan Kaufmann: San Francisco, CA, 1999, pp. 1033–1038.

    Google Scholar 

  19. G. Galeano, F. Fernández, M. Tomassini, and L. Vanneschi, Studying the influence of synchronous and asynchronous parallel GP on programs length evolution. in Congress on Evolutionary Computation (CEC'02), IEEE Press: Piscataway, NJ, 2002, pp. 1727–1732.

    Google Scholar 

  20. C. Gathercole and P. Ross, “Small populations over many generations can heat large populations over fewgenerations in genetic programming,” in Genetic Programming 1997: Proceedings of the Second Annual Conference, J. R. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, (eds.), Morgan Kaufmann: San Francisco, CA, 1997, pp. 111–118.

    Google Scholar 

  21. D. E. Goldberg, “Sizing populations for serial and parallel genetic algorithms,” in Proceedings of the Third International Conference on Genetic Algorithms, J. D. Schaffer, (ed.), Morgan Kaufmann: San Francisco, CA, 1989, pp. 70–79.

    Google Scholar 

  22. F. H. Bennet III, J. Koza, J. Shipman, and O. Stiffelman, “Building a parallel computer system for $18,000 that performs a half peta-flop per day,” in Proceedings of the Genetic and Evolutionary Computation Conference GECCO'99, W. Banzhaf, J. Daida, A. E. Eiben, M. Garzon, V. Honavar, M. Jakiela, and R. Smith, (eds.), Morgan Kaufmann: San Francisco, CA, 1999, pp. 1484–1490.

    Google Scholar 

  23. J. R. Koza, Genetic Programming, The MIT Press: Cambridge, MA, 1992.

    Google Scholar 

  24. W. B. Langdon and R. Poli, Foundations of Genetic Programming, Springer: Berllin, 2002.

    Google Scholar 

  25. S. C. Lin, W. F. Punch, and E. D. Goodman. “Coarse-grain parallel genetic algorithms: Categorization and a newapproach,” in Sixth IEEE SPDP, pp. 28–37, 1994.

  26. S. Luke and L. Panait, “Is the perfect the enemy of the good? in GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, W. B. Langdon, E. Cantú -Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke, and N. Jonoska, (eds.), Morgan Kaufmann Publishers: New York, 2002, pp. 820–828.

    Google Scholar 

  27. M. Oussaidè ne, B. Chopard, O. Pictet, and M. Tomassini, “Parallel genetic programming and its application to trading model induction,” Parallel Computing, vol. 23, pp. 1183–1198, 1997.

    Google Scholar 

  28. R. Poli, “Evolution of graph-like programs with parallel distributed genetic programming,” in Proceedings of the 7th International Conference on Genetic Algorithms, T. Bäck (ed.), Morgan Kaufmann: San Francisco, CA, 1997, pp. 346–353.

    Google Scholar 

  29. W. Punch, “Howeffective are multiple populations in genetic programming,” in Genetic Programming 1998: Proceedings of the Third Annual Conference, J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, D. Goldberg, H. Iba, and R. L. Riolo (eds.), Morgan Kaufmann: San Francisco, CA, 1998, pp. 308–313.

    Google Scholar 

  30. S. M. Ross. Introduction to Probability and Statistics for Engineers and Scientists, Academic Press: New York, 2000.

    Google Scholar 

  31. G. Spezzano, G. Folino, and C. Pizzuti, “CAGE: A tool for parallel genetic programming applications,” in Genetic Programming, Proceedings of EuroGP'2001, vol. 2038 of LNCS, J. Miller, M. Tomassini, P. L. Lanzi, C. Ryan, A. Tettamanzi, and W. Langdon (eds.), Springer: Berlin, 2001, pp. 51–63.

    Google Scholar 

  32. R. Tanese, “Parallel genetic algorithms for a hypercube,” in Proceedings of the Second International Conference on Genetic Algorithms, J. J. Grefenstette, (ed.), Lawrence Erlbaum Associates, 1987, p. 177.

  33. M. Tomassini, “Parallel and distributed evolutionary algorithms: a review,” in Evolutionary Algorithms in Engineering and Computer Science, K. Miettinen, M. Mäkelä, P. Neittanmäki, and J. Périaux (eds.), J. Wiley: New York, 1999, pp. 113–133.

    Google Scholar 

  34. M. Tomassini, L. Vanneschi, F. Fernández, and G. Galeano, “Experimental investigation of three distributed genetic programming models,” in Parallel Problem Solving from Nature—PPSN VII,vol. 2439 of Lecture Notes in Computer Science J. J. Merelo, P. Adamidis, H. G. Beyer, J.-L. Fernández-Villacanas, and H.-P. Schwefel (eds.), Springer-Verlag: Heidelberg, 2002, pp. 641–650.

    Google Scholar 

  35. D. Whitley, S. Rana, and R. B. Heckendorn, “Island model genetic algorithms and linearly separable problems,” in Evolutionary Computing: Proceedings of the AISB Workshop, Lecture Notes in computer science, vol. 1305, D. Corne and J. L. Shapiro, (eds.), Springer-Verlag, Berlin, 1997, pp. 109–125.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centro Universitario de Mérida, University of Extremadura, Spain

    Francisco Fernández

  2. Computer Science Institute, University of Lausanne, Switzerland

    Marco Tomassini & Leonardo Vanneschi

Authors
  1. Francisco Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Tomassini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Leonardo Vanneschi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fernández, F., Tomassini, M. & Vanneschi, L. An Empirical Study of Multipopulation Genetic Programming. Genetic Programming and Evolvable Machines 4, 21–51 (2003). https://doi.org/10.1023/A:1021873026259

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021873026259

Search

Navigation