Recombinative Hill-Climbing: A Stronger Search Method for Genetic Programming   [GP]

by

Hooper, D., C., Flann, N., S. and Fuller, S., R.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Genetic Programming 1997: Proceedings of the Second Annual Conference (Conference proceedings), 1997, p. 174-179
Keywords:Genetic Programming, Genetic Algorithms
Notes:
GP-97 Artificial Ant Santa Fe trail (only 400 time steps p177), Symbolic regression pi*x**2+ex+x**0.5 "RHC is shown to run about ten times faster than traditional GP for the same population size" p175 NB only on symbolic regression. Optional program simplification. 0.5% mutation. Overfitting.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InProceedings{Hooper:1997:rhc,
  author =       "Dale C. Hooper and Nicholas S. Flann and Stephanie R.
                 Fuller",
  title =        "Recombinative Hill-Climbing: {A} Stronger Search
                 Method for Genetic Programming",
  booktitle =    "Genetic Programming 1997: Proceedings of the Second
                 Annual Conference",
  editor =       "John R. Koza and Kalyanmoy Deb and Marco Dorigo and
                 David B. Fogel and Max Garzon and Hitoshi Iba and Rick
                 L. Riolo",
  year =         "1997",
  month =        "13-16 " # jul,
  keywords =     "Genetic Programming, Genetic Algorithms",
  pages =        "174--179",
  address =      "Stanford University, CA, USA",
  publisher_address = "San Francisco, CA, USA",
  publisher =    "Morgan Kaufmann",
  notes =        "GP-97 Artificial Ant Santa Fe trail (only 400 time
                 steps p177), Symbolic regression pi*x**2+ex+x**0.5
                 {"}RHC is shown to run about ten times faster than
                 traditional GP for the same population size{"} p175 NB
                 only on symbolic regression. Optional program
                 simplification. 0.5% mutation. Overfitting.",
}