In the following we apply the algorithm from Section 8.4.3 to three examples, namely two popular test functions [77] and a TCAD example. The first problem is to maximize the function
The second problem is to minimize the so called six hump camel back function

We used the algorithm as implemented in the EGO optimizer (cf. Section 9.3.1). For solving both optimization problems the populations size was individuals, the maximum number of generations was , the mutation probability , the ratio of to the length of the interval , and the number of steady state individuals was . This standard configuration determined the global extrema of both functions every time in ten consecutive runs to at least all digits given above.
The third and last example stems from a TCAD application. Here six parameters were extracted from the drain currents of the select transistor of a storage cell matching two transfer characteristics for two bulk voltages and two times 27 points. MINIMOS NT [16] was used as the device simulator. We used three optimizers, namely DONOPT, GENOPT, and SIMAN (cf. Section 9.3).
Figure 8.3 shows the progress of the three optimizers. The local optimizer DONOPT does not yield a good result, although its initial progress is fast. Furthermore, the evaluations of the genetic algorithm, GENOPT, are better parallelized on a cluster of workstations than those of simulated annealing, SIMAN, and thus in terms of wall clock time elapsed, the genetic algorithm is the fastest optimizer.
Clemens Heitzinger 20030508