Co-evolving functions in genetic programming: Dynamic ADF creation using GliB (original) (raw)

Abstract

In this paper we introduce a novel approach to the use of automatically defined functions (ADFs) with the help of a genetic library builder (GLiB). The new technique uses the two mutation operators of GLiB to automatically create subpopulations of ADFs during evolution, where these are termed evolution-defined functions (EDFs). Our approach consists of dynamically specifying separate subpopulations for each identified ADF, where a further population of programs uses individuals from these subpopulations during evaluations. Using a multiplexer problem and two classification tasks we compare a number of existing methods with this co-evolutionary approach. It is shown that dynamically creating ADF subpopulations (according to worth) proves more beneficial than specifying them a priori. It is also shown that the approach performs better than existing approaches — GP with ADFs and GP with GLiB — at all three tasks. Further, we extend the approach to allow the number of EDFs to emerge during the course of evolution, removing the need to specify how many functions are available a priori.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

  1. Intelligent Computer Systems Centre, University of the West of England, BS16 1QY, Bristol, UK
    Manu Ahluwalia & Larry Bull

Authors

  1. Manu Ahluwalia
  2. Larry Bull

Editor information

V. W. Porto N. Saravanan D. Waagen A. E. Eiben

Rights and permissions

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ahluwalia, M., Bull, L. (1998). Co-evolving functions in genetic programming: Dynamic ADF creation using GliB. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040831

Download citation

Publish with us