GEP Book

  GEP Biblio

  Visit Gepsoft


C. FERREIRA Complex Systems, 13 (2): 87-129, 2001

Gene Expression Programming: A New Adaptive Algorithm for Solving Problems

The Genetic Programming Rule Problem

For this problem F = {N, A, O, X, D, R, I, M} (representing, respectively: NOT, AND, OR, XOR, NAND, NOR, IF, and Majority, the first being a function of one argument, the second through fifth are functions of two arguments, and the last two are functions of three arguments), and T = {c, b, a, u, 1, 2, 3}. The rule table (27 = 128 fitness cases) is shown in Table 5 and the fitness was evaluated by equation (4.2). Thus, fmax = 128.

Three different solutions were discovered in one experiment:


Careful analysis of these programs shows that the GP rule is, like the GKL rule, a function of five arguments: c, a, u, 1, and 3.

Home | Contents | Previous | Next