27.06.2013 Views

Evolution and Optimum Seeking

Evolution and Optimum Seeking

Evolution and Optimum Seeking

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Numerical Comparison of Strategies 207<br />

x 2<br />

x<br />

1<br />

<strong>Optimum</strong><br />

Test position<br />

Figure 6.16: Eight di erent testvalues of the objective function in case of n =2<br />

the strategy employed has failed. Three intermediate classes of approximation are de ned<br />

in the obvious way.<br />

The maximum possible accuracy was required of all strategies. The corresponding<br />

free parameters of the strategies that enter the termination criteria have already been<br />

de ned in Table 6.2. In contrast to the rst test, no additional common termination rule<br />

was employed.<br />

A total of 50 problems were to be solved. The mathematical formulations of the<br />

problems are given in Appendix A, Section A.2. Some of them are only distinguished by<br />

the chosen initial conditions, others by the applied constraints. Nine out of 14 strategies<br />

or versions of basic strategies are not suited to solving constrained problems, at least not<br />

directly. Methods involving transformations of the variables <strong>and</strong> penalty function methods<br />

were not employed. An exception is the method of Rosenbrock, which only alters the<br />

objective function near the boundaries <strong>and</strong> can be applied in one pass otherwise penalty<br />

functions require a sequence of partial optimizations to be executed. The second series of<br />

tests therefore comprises one set of 28 unconstrained problems for all 14 strategies <strong>and</strong> a<br />

second set of 22 constrained problems for 5 of the strategies. The results are displayed<br />

together in Tables 6.5 to 6.8. The approximation to the objective that has been achieved<br />

in each case is indicated by a corresponding symbol, using the classes of accuracy de ned<br />

above.<br />

Any interesting features in the solution of individual problems are documented in the<br />

Appendix A, Section A.2, in some cases together with a brief analysis. Thus at this point<br />

it is only necessary to make some general observations about the reliability of the search<br />

methods for the totality of problems.<br />

Unconstrained Problems<br />

The results of the three versions of the coordinate strategies are very similar <strong>and</strong> generally<br />

unsatisfactory. A third of all the problems cannot be solved with them at all, or only<br />

very inaccurately. Exact solutions ( =10 ;38 ) are the exception <strong>and</strong> only in less than a

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!