IEEE Computational Intelligence Magazine - November 2021 - 87
fitness of the genome is a sum of all separate
fitness values of each gene, normalized
by N.
To examine the evolutionary dynamics
and properties of the NK model, we
use a mutation-based hill-climbing algorithm
(in accordance with [23]). There,
the single point in the fitness space represents
a converged species, i.e., the size
of the population is one and it evolves
by randomly changing one randomly
chosen gene per generation. If the fitness
of the mutated " population "
increases, it keeps the new genetic configuration.
If the fitness is equal, the
selection is made at random. All results
presented in this paper, acquired with
the NK model, are averaged over 10
runs (random start points) on each of 10
randomly produced NK functions
for every one combination of the given
parameters (N and K), i.e., 100 runs, for
20,000 generations. Here six values are
chosen from
01K ,5## for N = 20
and N = 100.
Some results of running the standard
NK model with different parameters to
demonstrate the characteristic behavior
of evolution depending upon the ruggedness
of the fitness landscape are presented
in Fig. 2. When K = 0 all gene
fitness contributions are independent
and randomly chosen within a range of
[0,1]. As a result, based on order statistics,
the average fitness is equal to 0.66.
For small values of K (up to K = 8),
regardless of N, the ruggedness of the
landscape increases, as does the height
of the better optima found. For values
of K higher than 8, the increasing
entanglement of gene dependencies
that define their fitness contributions
causes an increasing number of low fitness
local optima. Note that for high K
values relative to N, the central limit
theorem indicates that optima will average
around 0.5. The decrease in the
finally found fitness when K tends
towards N is an incident known as the
" complexity catastrophe " . The fittest
individuals found for tests with K > 6
and N = 20 (as depicted in Fig. 2) are
statistically significantly lower from
those with N = 100, when tested under
T-test (p < 0.05).
III Genome Growth in
the NK Model
In order to investigate the behavior of
variable-length genomes throughout
evolution under the abstract NK model,
the mutation operator is extended. In
addition to varying an arbitrarily picked
gene, the operator can now also add a
random number (G) of new arbitrarily
generated genes to the rightmost part
of the available genome NN G=+l^h
(for more details refer to the Supplementary
Material). Since it is generally
assumed that this new functionality
assigns new dependencies on the fitness
contributions, the first connection
of a randomly determined gene of the
pre-existing ones is assigned to the
newly added ones (for K 1$ ). In addition,
the newly added genes obtain K
dependencies throughout the entire
genome for their fitness contribution.
Thus, the extension to the genome has
a two-way influence on the fitness of
an individual.
As an initial trial, we investigate the
case of G = 1, shown in Fig. 3. In the
same fashion as before, the parameter N
is set to two values, N = 20 and N =
100. In the first case, with the initial
parameter N = 20 and for values of K >
10, the resulting fitness (Fig. 3(a)) is
enhanced compared with the static
genome length (Fig. 2), with the difference
statistically significant (T-test, p <
0.05). Here, the genome length increases
by approximately three genes (or up to
N 23=l
as depicted in Fig. 3(b)). As a
result, the occurrence of the complexity
catastrophe is no longer evident, at least
for the K values explored. The final
achieved genome lengths depicted in
Fig. 3(b) outline a high discrepancy
between maximum and minimum values;
however, for lower values of K (i.e.,
K < 4), the final genome lengths are
marginally smaller. Whereas, in all cases
with N = 100, the final fitness (Fig. 3(c))
is not statistically significantly different
(T-test,
p 005$ ) from the standard case
.
without genome growth. Nonetheless,
the amount of added genes (Fig. 3(d)) is
substantial, even double the amount
that is observed with N = 20 (Fig. 3(b))
and K > 4.
As the ruggedness of the fitness
landscape increases, the number of local
optima increases and their typical
height decreases. Hence, the increase of
ruggedness provides a larger window
for arbitrarily generated and added
genes to make a positive fitness contribution.
On the contrary, on landscapes
with lower ruggedness, high fitness
optima can be expected to be located
during the early stages of the search,
reducing the window of opportunity
for added genes to make a positive fitness
contribution. This is depicted in
Fig. 4, which shows the generations
(y-axis) needed for the search methodology
to converge to a peak for different
K parameters, with G = 0 (no
genome growth) and G = 1 (genome
growth with one gene per step). The
generation at which the genome
growth stops is also indicated. It can be
observed that for every K studied, the
evolutionary search continues for a longer
period when growth is included.
01 1
01 2
K0 K1
1
1
N = 3 K = 1
(a)
1
1
f(0)
0.76
0.23
0.56
0.98
f(1)
0.02
0.34
0.38
0.86
Fitness = 1/N ∑ f(n)
Fitness = (0.23 + 0.38 + 0.53)/3 = 0.38
(b)
FIGURE 1 An example NK model with parameters N = 3 and K = 1, where arrows indicate each
arbitrarily chosen dependent gene (left). The table with 2 K 1+^
h rows containing the fitness contributions
of each gene is shown (right), along with the fitness calculation for the example genome.
f(2)
0.99
0.82
0.53
0.19
NOVEMBER 2021 | IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE 87
IEEE Computational Intelligence Magazine - November 2021
Table of Contents for the Digital Edition of IEEE Computational Intelligence Magazine - November 2021
IEEE Computational Intelligence Magazine - November 2021 - Cover1
IEEE Computational Intelligence Magazine - November 2021 - Cover2
IEEE Computational Intelligence Magazine - November 2021 - 1
IEEE Computational Intelligence Magazine - November 2021 - 2
IEEE Computational Intelligence Magazine - November 2021 - 3
IEEE Computational Intelligence Magazine - November 2021 - 4
IEEE Computational Intelligence Magazine - November 2021 - 5
IEEE Computational Intelligence Magazine - November 2021 - 6
IEEE Computational Intelligence Magazine - November 2021 - 7
IEEE Computational Intelligence Magazine - November 2021 - 8
IEEE Computational Intelligence Magazine - November 2021 - 9
IEEE Computational Intelligence Magazine - November 2021 - 10
IEEE Computational Intelligence Magazine - November 2021 - 11
IEEE Computational Intelligence Magazine - November 2021 - 12
IEEE Computational Intelligence Magazine - November 2021 - 13
IEEE Computational Intelligence Magazine - November 2021 - 14
IEEE Computational Intelligence Magazine - November 2021 - 15
IEEE Computational Intelligence Magazine - November 2021 - 16
IEEE Computational Intelligence Magazine - November 2021 - 17
IEEE Computational Intelligence Magazine - November 2021 - 18
IEEE Computational Intelligence Magazine - November 2021 - 19
IEEE Computational Intelligence Magazine - November 2021 - 20
IEEE Computational Intelligence Magazine - November 2021 - 21
IEEE Computational Intelligence Magazine - November 2021 - 22
IEEE Computational Intelligence Magazine - November 2021 - 23
IEEE Computational Intelligence Magazine - November 2021 - 24
IEEE Computational Intelligence Magazine - November 2021 - 25
IEEE Computational Intelligence Magazine - November 2021 - 26
IEEE Computational Intelligence Magazine - November 2021 - 27
IEEE Computational Intelligence Magazine - November 2021 - 28
IEEE Computational Intelligence Magazine - November 2021 - 29
IEEE Computational Intelligence Magazine - November 2021 - 30
IEEE Computational Intelligence Magazine - November 2021 - 31
IEEE Computational Intelligence Magazine - November 2021 - 32
IEEE Computational Intelligence Magazine - November 2021 - 33
IEEE Computational Intelligence Magazine - November 2021 - 34
IEEE Computational Intelligence Magazine - November 2021 - 35
IEEE Computational Intelligence Magazine - November 2021 - 36
IEEE Computational Intelligence Magazine - November 2021 - 37
IEEE Computational Intelligence Magazine - November 2021 - 38
IEEE Computational Intelligence Magazine - November 2021 - 39
IEEE Computational Intelligence Magazine - November 2021 - 40
IEEE Computational Intelligence Magazine - November 2021 - 41
IEEE Computational Intelligence Magazine - November 2021 - 42
IEEE Computational Intelligence Magazine - November 2021 - 43
IEEE Computational Intelligence Magazine - November 2021 - 44
IEEE Computational Intelligence Magazine - November 2021 - 45
IEEE Computational Intelligence Magazine - November 2021 - 46
IEEE Computational Intelligence Magazine - November 2021 - 47
IEEE Computational Intelligence Magazine - November 2021 - 48
IEEE Computational Intelligence Magazine - November 2021 - 49
IEEE Computational Intelligence Magazine - November 2021 - 50
IEEE Computational Intelligence Magazine - November 2021 - 51
IEEE Computational Intelligence Magazine - November 2021 - 52
IEEE Computational Intelligence Magazine - November 2021 - 53
IEEE Computational Intelligence Magazine - November 2021 - 54
IEEE Computational Intelligence Magazine - November 2021 - 55
IEEE Computational Intelligence Magazine - November 2021 - 56
IEEE Computational Intelligence Magazine - November 2021 - 57
IEEE Computational Intelligence Magazine - November 2021 - 58
IEEE Computational Intelligence Magazine - November 2021 - 59
IEEE Computational Intelligence Magazine - November 2021 - 60
IEEE Computational Intelligence Magazine - November 2021 - 61
IEEE Computational Intelligence Magazine - November 2021 - 62
IEEE Computational Intelligence Magazine - November 2021 - 63
IEEE Computational Intelligence Magazine - November 2021 - 64
IEEE Computational Intelligence Magazine - November 2021 - 65
IEEE Computational Intelligence Magazine - November 2021 - 66
IEEE Computational Intelligence Magazine - November 2021 - 67
IEEE Computational Intelligence Magazine - November 2021 - 68
IEEE Computational Intelligence Magazine - November 2021 - 69
IEEE Computational Intelligence Magazine - November 2021 - 70
IEEE Computational Intelligence Magazine - November 2021 - 71
IEEE Computational Intelligence Magazine - November 2021 - 72
IEEE Computational Intelligence Magazine - November 2021 - 73
IEEE Computational Intelligence Magazine - November 2021 - 74
IEEE Computational Intelligence Magazine - November 2021 - 75
IEEE Computational Intelligence Magazine - November 2021 - 76
IEEE Computational Intelligence Magazine - November 2021 - 77
IEEE Computational Intelligence Magazine - November 2021 - 78
IEEE Computational Intelligence Magazine - November 2021 - 79
IEEE Computational Intelligence Magazine - November 2021 - 80
IEEE Computational Intelligence Magazine - November 2021 - 81
IEEE Computational Intelligence Magazine - November 2021 - 82
IEEE Computational Intelligence Magazine - November 2021 - 83
IEEE Computational Intelligence Magazine - November 2021 - 84
IEEE Computational Intelligence Magazine - November 2021 - 85
IEEE Computational Intelligence Magazine - November 2021 - 86
IEEE Computational Intelligence Magazine - November 2021 - 87
IEEE Computational Intelligence Magazine - November 2021 - 88
IEEE Computational Intelligence Magazine - November 2021 - 89
IEEE Computational Intelligence Magazine - November 2021 - 90
IEEE Computational Intelligence Magazine - November 2021 - 91
IEEE Computational Intelligence Magazine - November 2021 - 92
IEEE Computational Intelligence Magazine - November 2021 - 93
IEEE Computational Intelligence Magazine - November 2021 - 94
IEEE Computational Intelligence Magazine - November 2021 - 95
IEEE Computational Intelligence Magazine - November 2021 - 96
IEEE Computational Intelligence Magazine - November 2021 - 97
IEEE Computational Intelligence Magazine - November 2021 - 98
IEEE Computational Intelligence Magazine - November 2021 - 99
IEEE Computational Intelligence Magazine - November 2021 - 100
IEEE Computational Intelligence Magazine - November 2021 - Cover3
IEEE Computational Intelligence Magazine - November 2021 - Cover4
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202311
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202308
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202305
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202302
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202211
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202208
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202205
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202202
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202111
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202108
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202105
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202102
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202011
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202008
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202005
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_202002
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201911
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201908
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201905
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201902
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201811
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201808
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201805
https://www.nxtbook.com/nxtbooks/ieee/computationalintelligence_201802
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring17
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring16
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring15
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring14
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_summer13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_spring13
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_winter12
https://www.nxtbook.com/nxtbooks/ieee/computational_intelligence_fall12
https://www.nxtbookmedia.com