Genetic L-System Programming

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

  author =       "Christian Jacob",
  title =        "Genetic L-System Programming",
  booktitle =    "Parallel Problem Solving from Nature III",
  year =         "1994",
  editor =       "Yuval Davidor and Hans-Paul Schwefel and 
                 Reinhard M{\"a}nner",
  series =       "LNCS",
  volume =       "866",
  pages =        "334--343",
  address =      "Jerusalem",
  publisher_address = "Berlin, Germany",
  month =        "9-14 " # oct,
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "3-540-58484-6",
  URL =          "",
  URL =          "",
  DOI =          "doi:10.1007/3-540-58484-6_277",
  size =         "10 pages",
  abstract =     "We present the Genetic L-System Programming (GLP)
                 paradigm for evolutionary creation and development of
                 parallel rewrite systems (L-systems,
                 Lindenmayer-systems) which provide a commonly used
                 formalism to describe developmental processes of
                 natural organisms. The L-system paradigm will be
                 extended for the purpose of describing time- and
                 context-dependent formation of formal data structures
                 representing rewrite rules or computer programs
                 (expressions). With GLP two methods gleaned from nature
                 are combined: simulated evolution and simulated
                 structure formation. A prototypical GLP system
                 implementation is described. Controlled evolution of
                 complex structures is exemplified by the development of
                 tree structures generated by the movement of a
  notes =        "GLP combines simulated evolution and simulated
                 structure formation (based on Lindenmayer

                 PPSN3 L-systems difficult for human programmers to use,
                 presents simple example where L-system is evolved using
                 a GP.

                 Initial population created from pool of pre-defined
                 patterns (subtrees, building blocks?) rather than GP
                 functions or terminals. Such patterns and genetic
                 operators have a rank (like a fitness) which is used to
                 bias the choice of pattern. A pattern is a gramtical
                 rule and specifies (a number of possible) types for
                 each of its arguments.

                 Genetic operators include copying templates (sub
                 trees?) into the pattern pool (or genetic library).",

Genetic Programming entries for Christian Jacob