Population Management for Automatic Design of Algorithms through Evolution

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

  author =       "Roland Olsson",
  title =        "Population Management for Automatic Design of
                 Algorithms through Evolution",
  booktitle =    "Proceedings of the 1998 IEEE World Congress on
                 Computational Intelligence",
  year =         "1998",
  pages =        "592--597",
  address =      "Anchorage, Alaska, USA",
  month =        "5-9 " # may,
  publisher =    "IEEE Press",
  keywords =     "genetic algorithms, genetic programming, ADATE,
                 algorithm evolution, automatic algorithm design,
                 automatic help function construction, computational
                 resources, diversification methods, iterative program
                 reexpansion, local optimum entrapment, missing links,
                 population maintenance, population management, program
                 chains, program transformations, recursive help
                 functions, recursive program synthesis, similar
                 programs, syntactic complexity/evaluation
                 value-ordering scheme, automatic programming, recursive
  ISBN =         "0-7803-4869-9",
  URL =          "http://www.ia-stud.hiof.no/~rolando/popart3.ps",
  file =         "c102.pdf",
  DOI =          "doi:10.1109/ICEC.1998.700095",
  size =         "6 pages",
  abstract =     "The paper describes population based search in the
                 system Automatic Design of Algorithms through Evolution
                 (ADATE) that maintains chains of gradually bigger and
                 better programs. The main challenge is to avoid missing
                 links that lead to entrapment in too bad local optima.
                 To avoid entrapment, the ADATE system employs iterative
                 re-expansion of programs, population maintenance using
                 a syntactic complexity / evaluation value ordering
                 scheme and three different diversification methods that
                 strive to avoid too similar programs. When combined
                 with the general program transformations explained in a
                 previous paper, these techniques enable ADATE to
                 synthesize recursive programs with automatic invention
                 of recursive help functions. We also briefly present
                 experimental results supporting that automatic
                 synthesis of complex programs from {"}first
                 principles{"} is possible indeed, but only if vast
                 computational resources are employed effectively.",
  notes =        "ICEC-98 Held In Conjunction With WCCI-98 --- 1998 IEEE
                 World Congress on Computational Intelligence

                 Solutions to, Reversing a list, list delete min,
                 cartesian product, intersecting two lists, string
                 comparison, sorting a list, locating a substring, BST
                 insertion, binary multiplication, simplifying a
                 polynomial, transposing a matrix, permutation
                 generation, BST deletion, Path finding, Binary
                 addition, Rectangle intersection",

Genetic Programming entries for J Roland Olsson