Evolution and Optimum Seeking

Numerical Comparison of Strategies 185
Table 6.3 (continued)
COMP{Complex method of Box (2n vertices)
Number of variables Numberofobjective Computation time
function calls in seconds
3 69 0.22
6 259 1.62
10 535 6.72
20 1447 72.0
30 2621 211
60 7263 2240
(max) 95 14902 11000
All numbers are averages over several attempts.
EVOL{(1+1) evolution strategy (average values)
Number of variables Number of mutations Computation time
in seconds
3 49 0.17
6 154 0.79
10 224 1.74
20 411 6.47
30 630 14.0
60 1335 60.0
100 2192 149
150 3322 340
200 4232 565
300 6666 1310
600 13819 5440
1000 23607 15600
Maximum numberofvariables (4,000) not achieved because too
much computation time required.
Number of objective function calls = 1 + number of mutations