Information Technology Reference
In-Depth Information
*aa++aaaaaa*+a++aaaaaa+0*-11010**-*11010,0-[14] = 236.4288
*aa/+aaaaaa-aa+*aaaaaa0+*-11010*/-011010,3-[15] = 0
*aa++aaaaaa*aa++aaaaaa+0*-01111-+**00100,1-[16] = 376.9933
*aaa+aaaaaa*aa++aaaaaa+**-11111-*-+00100,0-[17] = 99.37589
*aaa+aaaaaa++*aaaaaaaa+0*-110100**-10010,1-[18] = 376.9933
*aa++aaaaaa*aa++aaaaaa+0*-01111-*-+00100,0-[19] = 376.9933
As you can see in Figure 6.7, ADF
0
continues to be the ADF that counts,
since ADF
1
, which encodes zero, is used just as a neutral block in Cell
0
. Note
also that this new individual invokes ADF
0
three different times from the
best main program, creating a modular solution that fits the target function
(6.1) much more accurately than its predecessors (Figure 6.8).
a.
01234560123
*aa++aaaaaa-aa++aaaaaa
01234560123012345601012345601
+0*-01010
****01010
b.
ADF
0
ADF
1
a
a
a
a
c.
Cell
0
Cell
1
ADF
0
ADF
0
ADF
0
ADF
1
ADF
0
ADF
1
ADF
0
ADF
1
ADF
0
2
2
2
4
2
y
[(0)
(
a
)
]
(
a
)
(
a
)
a
a
d.
Figure 6.7.
Best individual of generation 3 (chromosome 3). It has a fitness of
421.5158 evaluated against the set of fitness cases presented in Table 6.1.
a)
The
chromosome of the individual with the best cell shown in bold.
b)
The ADFs
codified by each gene.
c)
The cells or main programs encoded in the homeotic
genes (the best cell is shown in gray).
d)
The mathematical expression encoded in
the best cell (the contribution of each ADF is shown in parentheses). Note that
ADF
1
is doing nothing in the best cell.
