Advertisement

Polymorphism and Genetic Programming

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2038)

Abstract

Types have been introduced to Genetic Programming (GP) by researchers with different motivation. We present the concept of types in GP and introduce a typed GP system, PolyGP, that supports polymorphism through the use of three different kinds of type variable. We demonstrate the usefulness of this kind of polymorphism in GP by evolving two polymorphic programs (nth and map) using the system. Based on the analysis of a series of experimental results, we conclude that this implementation of polymorphism is effective in assisting GP evolutionary search to generate these two programs. PolyGP may enhance the applicability of GP to a new class of problems that are difficult for other polymorphic GP systems to solve.

Keywords

Fitness Function Genetic Programming Type Variable Genetic Operation Dynamic Typing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    Brave, S.: Evolving recursive programs for tree search. In: Advances in Genetic Programming II. P.J. Angeline and K.E. Kinnear, Jr. (eds.), page 203–219. 1996.Google Scholar
  2. [2]
    Cardelli, L. and Wegner, P.: On understanding types, data abstraction, and polymorphism. In: Computing Surveys, Vol. 17:4, pages 471–522. 1985.CrossRefGoogle Scholar
  3. [3]
    Haynes, T.D., Schoenefeld, D.A. and Wainwright, R.L.: Type inheritance in strongly typed genetic programming. In: Advances in Genetic Programming II, P.J. Angeline and K.E. Kinnear, Jr. (eds.), pages 359–376. 1996.Google Scholar
  4. [4]
    Haynes, T.D., Wainwright, R.L., Sandip, S. and Schoenefeld, D.: Strongly typed genetic programming in evolving cooperation strategies. In Proceedings of the Sixth International Conference on Genetic Algorithms, pages 271–278, 1995.Google Scholar
  5. [5]
    Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA. 1992.zbMATHGoogle Scholar
  6. [6]
    Langdon, W.B.: Scaling of program fitness spaces. In: Evolutionary Computation, Vol. 7No. 4, pages 399–428, 1999.CrossRefGoogle Scholar
  7. [7]
    Luke, S.: personal communication, 2000.Google Scholar
  8. [8]
    McPhee, N.F., Hopper, N.J. and Reierson, M.L.: Impact of types on essentially typeless problems in GP. In: Genetic Programming 1998: Proceedings of the Third Annual Conference. pages 232–240. 1998.Google Scholar
  9. [9]
    Montana, D.J.: Strongly typed genetic programming. In: Evolutionary Computation, Vol. 3:2, pages 199–230. 1995.CrossRefGoogle Scholar
  10. [10]
    M.L. Wong and K.S. Leung. An adaptive inductive logic programming system using genetic programming. Evolutionary Programming IV: Proceedings of the Fourth Annual Conference on Evolutionary Programming. pages 737–752, 1995.Google Scholar
  11. [11]
    Yu, T. and Bentley, P.: Methods to evolve legal phenotypes. In: Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature. Lecture Notes in Computer Science, Vol. 1498, Springer-Verlag, Berlin, pages 280–291, 1998.Google Scholar
  12. [12]
    Yu, T. and Clack, C.: PolyGP: a polymorphic genetic programming system in haskell. In: Proceedings of the Third Annual Genetic Programming Conference, page 416–421, 1998.Google Scholar
  13. [13]
    Yu, T.: An Analysis of the Impact of Functional Programming Techniques on Genetic Programming, Phd Thesis, University College London, 1999.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Tina Yu
    • 1
  1. 1.Chevron Information Technology CompanySan RamonUSA

Personalised recommendations