Linear Genetic Programming of Parsimonious Metaheuristics

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

  author =       "R. E. Keller and R. Poli",
  title =        "Linear Genetic Programming of Parsimonious
  booktitle =    "2007 IEEE Congress on Evolutionary Computation",
  year =         "2007",
  editor =       "Dipti Srinivasan and Lipo Wang",
  pages =        "4508--4515",
  address =      "Singapore",
  month =        "25-28 " # sep,
  organization = "IEEE Computational Intelligence Society",
  publisher =    "IEEE Press",
  ISBN =         "1-4244-1340-0",
  file =         "1166.pdf",
  keywords =     "genetic algorithms, genetic programming",
  DOI =          "doi:10.1109/CEC.2007.4425062",
  abstract =     "We use a form of grammar-based linear Genetic
                 Programming (GP) as a hyperheuristic, i.e., a search
                 heuristic on the space of heuristics. This technique is
                 guided by domain specific languages that one designs
                 taking inspiration from elementary components of
                 specialised heuristics and metaheuristics for a domain.
                 We demonstrate this approach for travelling salesman
                 problems for which we test different languages,
                 including one containing a looping construct.
                 Experimentation with benchmark instances from the
                 TSPLIB shows that the GP hyperheuristic routinely and
                 rapidly produces parsimonious metaheuristics that find
                 tours whose lengths are highly competitive with the
                 best real-valued lengths from literature.",
  notes =        "CEC 2007 - A joint meeting of the IEEE, the EPS, and
                 the IET.

                 IEEE Catalog Number: 07TH8963C",

Genetic Programming entries for Robert E Keller Riccardo Poli