Skip to main content
SpringerLink
Log in

Multi Niche Parallel GP with a Junk-Code Migration Model

  • Conference paper
  • First Online:
Genetic Programming (EuroGP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2610))

Included in the following conference series:

Abstract

We describe in this paper a parallel implementation of Multi Niche Genetic Programming that we use to test the performance of a modified migration model. Evolutive introns is a technique developed to accelerate the convergence of GP in classification and symbolic regression problems. Here, we will copy into a differentiated subpopulation the individuals that due to the evolution process contain longer Evolutive Introns. Additionally, the multi island model is parallelised in order to speed up convergence. These results are also analysed. Our results prove that the multi island model achieves faster convergence in the three different symbolic regression problems tested, and that the junk-coded subpopulation is not significantly worse than the others, which reinforces our belief in that the important thing is not only fitness but keeping good genetic diversity along all the evolution process. The overhead introduced in the process by the existence of various island, and the migration model is reduced using a multi-thread approach.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Andre and J. Koza. A parallel implementation of genetic programming that achieves super-linear performance. In Proceedings of int. Conf. on Parallel and Distributed Processing Techniques and Applications, pages-. In Arabnia, Hamid R. (editor), 1996.

    Google Scholar 

  2. D. Andre and A. Teller. A study in program response and the negative effects of introns in genetic programming. In John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 12–20, Stanford University, CA, USA, 28-31 July 1996. MIT Press.

    Google Scholar 

  3. P. J. Angeline. Genetic programming and emergent intelligence. In Kenneth E. Kinnear, Jr., editor, Advances in Genetic Programming, chapter 4, pages 75–98. MIT Press, 1994.

    Google Scholar 

  4. F. Fernandez, M. Tomassini, W. F. Punch III, and J. M. Sanchez. Experimental study of multipopulation parallel genetic programming. In Riccardo Poli, Wolfgang Banzhaf, William B. Langdon, Julian F. Miller, Peter Nordin, and Terence C. Fogarty, editors, Genetic Programming, Proceedings of EuroGP’2000, volume 1802 of LNCS, pages 283–293, Edinburgh, 15-16 April 2000. springer-Verlag.

    Google Scholar 

  5. Message Passing Interface Forum. MPI: A message-passing interface standard. Technical Report UT-CS-94-230, 1994.

    Google Scholar 

  6. S. García and F. González. Evolutive introns: A non-costly method of using introns in GP. Genetic Programming and Evolvable Machines, 2(2):111–122, June 2001.

    Article  MATH  Google Scholar 

  7. T. Haynes. Duplication of coding segments in genetic programming. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pages 344–349, Portland, OR, 1996.

    Google Scholar 

  8. I. M. A. Kirkwood, S. H. Shami, and M. C. Sinclair. Discovering simple faulttolerant routing rules using genetic programming. In ICANNGA97, University of East Anglia, Norwich, UK, 1997.

    Google Scholar 

  9. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.

    MATH  Google Scholar 

  10. J.R. Levenick. Inserting introns improves genetic algorithm success rate: Taking a cue from biology. Proceedings of the Fourth International Conference on Genetic algorithms, 1:123–127, 1991.

    Google Scholar 

  11. Message Passing Interface Forum MPIF. MPI-2: Extensions to the Message-Passing Interface. Technical Report, University of Tennessee, Knoxville, 1996.

    Google Scholar 

  12. P. Nordin, F. Francone, and W. Banzhaf. Explicitly defined introns and destructive crossover in genetic programming. In Justinian P. Rosca, editor, Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, pages 6–22, Tahoe City, California, USA, July 1995.

    Google Scholar 

  13. B. Punch. Royal trees as a benchmark problem for genetic programming: A parallel processing example. In Peter J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, pages-. MIT Press, Cambridge, MA, USA, 1996.

    Google Scholar 

  14. Terence Soule and Robert B. Heckendorn. An analysis of the causes of code growth in genetic programming. Genetic Programming and Evolvable Machines, 3(3):283–309, September 2002.

    Article  MATH  Google Scholar 

  15. M. Wineberg and F. Oppacher. The benefits of computing with introns. In John R. Koza, David E. Goldberg, David B. Fogel, and Rick L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 410–415, Stanford University, CA, USA, 28-31 1996. MIT Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Oviedo, Spain

    Santi Garcia

  2. School of Informatics, University of Edinburgh, Edinburgh

    John Levine

  3. INDRA., Alcala de Henares, Madrid, Spain

    Fermin Gonzalez

Authors
  1. Santi Garcia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Levine
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fermin Gonzalez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science and Information Systems, University of Limerick, Limerick, Ireland

    Conor Ryan

  2. Department of Computer Science, University of Idaho, 83844-1010, Moscow, ID, USA

    Terence Soule

  3. Department of Computer Science, Free University of Amsterdam, 1081, HV Amsterdam, The Netherlands

    Maarten Keijzer

  4. Department of Computer Science, University of Essex, Wivenhoe Park, CO4 3SQ, Colchester, UK

    Edward Tsang  & Riccardo Poli  & 

  5. Department of Computer Science, University of Coimbra, Polo II, Pinhal Marrocos, 3030-290, Coimbra, Portugal

    Ernesto Costa

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Garcia, S., Levine, J., Gonzalez, F. (2003). Multi Niche Parallel GP with a Junk-Code Migration Model. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds) Genetic Programming. EuroGP 2003. Lecture Notes in Computer Science, vol 2610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36599-0_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-36599-0_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00971-9

  • Online ISBN: 978-3-540-36599-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation