A Comparative Analysis of Genetic Programming

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

@InCollection{OReilly:1996:aigp2,

• author = "Una-May O'Reilly and Franz Oppacher",
• title = "A Comparative Analysis of Genetic Programming",
• booktitle = "Advances in Genetic Programming 2",
• publisher = "MIT Press",
• year = "1996",
• editor = "Peter J. Angeline and K. E. {Kinnear, Jr.}",
• pages = "23--44",
• chapter = "2",
• address = "Cambridge, MA, USA",
• keywords = "genetic algorithms, genetic programming",
• ISBN = "0-262-01158-1",
• URL = "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6277528",
• DOI = "doi:10.7551/mitpress/1109.003.0006",
• size = "22 pages",
• abstract = "In order to analyze Genetic Programming (GP), this chapter compares it with two alternative adaptive search algorithms, Simulated Annealing (SA) and Stochastic Iterated Hill Climbing (SIHC). SIHC and SA are used to solve program discovery problems posed in the style of GP. In separate versions they employ either GP's crossover operator or a mutation operator. The comparisons in terms of likelihood of success and efficiency show them to be effective. Based upon their success, hybrid versions of GP and hill climbing are designed that improve upon a canonical version of GP. Program discovery practitioners may find it useful to coherently view all the algorithms this chapter considers by using the perspective of evolution.",

}

Genetic Programming entries for Una-May O'Reilly Franz Oppacher

Citations