Dynamic Page Based Crossover in Linear Genetic Programming

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

@Article{heywood:2002:SMCB,
  author =       "M. I. Heywood and A. N. Zincir-Heywood",
  title =        "Dynamic Page Based Crossover in Linear Genetic
                 Programming",
  journal =      "IEEE Transactions on Systems, Man, and Cybernetics:
                 Part B - Cybernetics",
  year =         "2002",
  volume =       "32",
  number =       "3",
  pages =        "380--388",
  month =        jun,
  email =        "mheywood@cs.dal.ca",
  keywords =     "genetic algorithms, genetic programming, linear
                 genetic programming, crossover operator, homologous
                 crossover, natural selection",
  DOI =          "doi:10.1109/TSMCB.2002.999814",
  ISSN =         "1083-4419",
  abstract =     "Page-based Linear Genetic Programming (GP) is proposed
                 in which individuals are described in terms of a number
                 of pages. Pages are expressed in terms of a fixed
                 number of instructions, constant for all individuals in
                 the population. Pairwise crossover results in the
                 swapping of single pages, thus individuals are of a
                 fixed number of instructions. Head-to-head comparison
                 with Tree structured GP and block-based Linear GP
                 indicates that the page-based approach evolves succinct
                 solutions without penalising generalisation ability.",
}

Genetic Programming entries for Malcolm Heywood Nur Zincir-Heywood

Citations