Information Technology Reference
In-Depth Information
70
BCA
Mega Mutation 1
Mega Mutation 2
Anti Elitism
60
50
40
30
20
10
0
0
1
2
3
4
5
6
7
8
9
10
x 10
6
Number of Evaluations
Fig. 5.
Barchartforproblem#3
20
BCA
Mega Mutation 1
Mega Mutation 2
Anti Elitism
Anti Elitism + Mega Mutation
15
10
5
0
0
1
2
3
4
5
6
7
8
9
10
x 10
7
Number of Evaluations
Fig. 6.
Barchartforproblem#4
finds an optimal solution, it does so within a small number of iterations, thus
the amount of work done by a successful BCA run is quite small, as most runs
tend to get stuck in local optima. Unfortunately, as we can see from table 1,
very few BCA runs are successful on equation 4. The megamutation algorithms
