A Methodology for Processing Problem Constraints in Genetic Programming   [GP]

by

Janikow, C., Z.

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: Computers and Mathematics with Applications (Journal), 1996, p. 97-113
Keywords:genetic algorithms, genetic programming
Notes:
http://laplace.cs.umsl.edu/~janikow/cgp-lilgp/ CGP uses GP [Koza] to evolve programs (or trees in general). It extends GP by allowing syntactic and sematical constraints on function calls (the constraints can be weighted rather than strict), plus function overloading. In future releases, evolution of representation (i.e., constraints), ADFs, and recursive functions are planned. lil-gp comparison of solving 11-multiplexor problem nine different ways with different type systems. Some tighter (than Koza) type systems (eg different address and data bits, different function sets) are worse than Koza GP and some are better. Problem dependant reasons for this suggested. Comparison with GIL. STGP
URL(s):Postscript
(G)zipped postscript

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@Article{janikow:1996:CGP,
  author =       "Cezary Z. Janikow",
  title =        "A Methodology for Processing Problem Constraints in
                 Genetic Programming",
  journal =      "Computers and Mathematics with Applications",
  year =         "1996",
  volume =       "32",
  number =       "8",
  pages =        "97--113",
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://www.cs.umsl.edu/Faculty/janikow/psdocs/cgp.CMwA.ps",
  notes =        "http://laplace.cs.umsl.edu/~janikow/cgp-lilgp/ CGP
                 uses GP [Koza] to evolve programs (or trees in
                 general). It extends GP by allowing syntactic and
                 sematical constraints on function calls (the
                 constraints can be weighted rather than strict), plus
                 function overloading. In future releases, evolution of
                 representation (i.e., constraints), ADFs, and recursive
                 functions are planned.

                 lil-gp comparison of solving 11-multiplexor problem
                 nine different ways with different type systems. Some
                 tighter (than Koza) type systems (eg different address
                 and data bits, different function sets) are worse than
                 Koza GP and some are better. Problem dependant reasons
                 for this suggested. Comparison with GIL. STGP",
}