遗传编程演算法附件.pptVIP

Genetic Programming遺傳編程演算法 Background Origin of GP: Koza, John R. 1992. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: The MIT Press. Work since early 1980s; series of books (4 volumes) in various editions Considered a branch of AI General Idea Use the principle of genetic algorithm Use programs as data Representation of Programs Initially: symbolic representation (LISP language) LISP (and PROLOG) provide a facility to represent programs as data structures Allows for self-modifying programs Allows for meta-programming Interpreters Genetic programming Preparatory Steps of Genetic Programming The human user communicates the high-level statement of the problem to the genetic programming system by performing certain well-defined preparatory steps. The five major preparatory steps for the basic version of genetic programming require the human user to specify (1) the set of terminals (e.g., the independent variables of the problem, zero-argument functions, and random constants) for each branch of the to-be-evolved program, (2) the set of primitive functions for each branch of the to-be-evolved program, (3) the fitness measure (for explicitly or implicitly measuring the fitness of individuals in the population), (4) certain parameters for controlling the run, and (5) the termination criterion and method for designating the result of the run. Example of Representation Generate well-formed formulas from variable A and a set of function symbols, for example { +, -, *, %, sqrt } Examples: ( + A ( * ( sqrt A ) A ) ) (* A (- (* A A) (sqrt A) ) ) Example of Representation Trees are a universal form, e.g. consider Arithmetic formula Logical formula Program Tree based representation Tree based representation Tree based representation if (root(x+y) 10) return x else return x/y More General Representation(There’s no agreed upon formalism) can be replaced by any boolean function Beware: more expressive means bigger sp