Generating Lambda Term Individuals in Typed Genetic Programming Using Forgetful A*

Created by W.Langdon from gp-bibliography.bib Revision:1.4420

  title =        "Generating Lambda Term Individuals in Typed Genetic
                 Programming Using Forgetful {A*}",
  author =       "Tomas Kren and Roman Neruda",
  pages =        "1847--1854",
  booktitle =    "Proceedings of the 2014 IEEE Congress on Evolutionary
  year =         "2014",
  month =        "6-11 " # jul,
  editor =       "Carlos A. {Coello Coello}",
  address =      "Beijing, China",
  ISBN =         "0-7803-8515-2",
  keywords =     "genetic algorithms, Genetic programming,
                 Representation and operators, lambda calculus,
  DOI =          "doi:10.1109/CEC.2014.6900547",
  abstract =     "Tree based genetic programming (GP) traditionally uses
                 simple S-expressions to represent programs, however
                 more expressive representations, such as lambda
                 calculus, can exhibit better results while being better
                 suited for typed GP. In this paper we present
                 population initialisation methods within a framework of
                 GP over simply typed lambda calculus that can be also
                 used in the standard GP approach. Initialisations can
                 be parametrised by different search strategies, leading
                 to wide spectrum of methods corresponding to standard
                 ramped half-and-half initialisation on one hand, or
                 exhaustive systematic search on the other. A novel
                 geometric strategy is proposed that balances those two
                 approaches. Experiments on well known benchmark
                 problems show that the geometric strategy outperforms
                 the standard generating method in success rate, best
                 fitness value, time consumption and average individual
  notes =        "WCCI2014",

Genetic Programming entries for Tomas Kren Roman Neruda