Simple Implementation of Genetic Programming by Column Tables   [GP]

by

Kvasnièka, V., Pospóchal, J. and Pospíchal, J.

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: Soft Computing in Engineering Design and Manufacturing (Conference proceedings), 1997, p. 48-56
Keywords:genetic algorithms, genetic programming
Abstract:
Simple implementation of genetic programming [GP] by making use of the column tables is discussed. Implementations of Koza's genetic programming [GP] in compiled languages are usually not most efficient when crossover is applied. If chromosomes are directed acyclic graphs, more efficient than rooted trees both in memory requirement as well as in evaluation time of chromosome, then crossover requires traversing the data structures [DS] and their preliminary analysis. Column tables inherently code directed acyclic graphs, the implementation of crossover is simple and needs neither traversing nor checking of integrity of resulting data structures [DS] and should be therefore more efficient. Stochastic transformation operation mutation is also easily defined. Column tables can represent graphs with several output nodes and may be used e.g. for optimization of feed-forward neural networks. Simple [NN] illustrative examples of symbolic regression based [SR] on the column tables are presented.
Notes:
WSC2 Second On-line World Conference on Soft Computing in Engineering Design and Manufacturing
URL(s):(G)zipped postscript
HTML

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InProceedings{Kvasnièka:1997:WSC2,
  author =       "Vladimír Kvasnièka and Jiøí Pospíchal",
  title =        "Simple Implementation of Genetic Programming by Column
                 Tables",
  booktitle =    "Soft Computing in Engineering Design and
                 Manufacturing",
  year =         "1997",
  editor =       "P. K. Chawdhry and R. Roy and R. K. Pant",
  pages =        "48--56",
  publisher_address = "Godalming, GU7 3DJ, UK",
  month =        "23-27 " # jun,
  publisher =    "Springer-Verlag London",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "3-540-76214-0",
  URL =          "http://www.bath.ac.uk/Departments/Eng/wsc2/ind_paper/p_kvasni.html",
  abstract =     "Simple implementation of genetic programming by making
                 use of the column tables is discussed. Implementations
                 of Koza's genetic programming in compiled languages are
                 usually not most efficient when crossover is applied.
                 If chromosomes are directed acyclic graphs, more
                 efficient than rooted trees both in memory requirement
                 as well as in evaluation time of chromosome, then
                 crossover requires traversing the data structures and
                 their preliminary analysis. Column tables inherently
                 code directed acyclic graphs, the implementation of
                 crossover is simple and needs neither traversing nor
                 checking of integrity of resulting data structures and
                 should be therefore more efficient. Stochastic
                 transformation operation mutation is also easily
                 defined. Column tables can represent graphs with
                 several output nodes and may be used e.g. for
                 optimization of feed-forward neural networks. Simple
                 illustrative examples of symbolic regression based on
                 the column tables are presented.",
  notes =        "WSC2 Second On-line World Conference on Soft Computing
                 in Engineering Design and Manufacturing",
}