The JAVA Implementation of the 1+1 ES

We are using a JAVA implementation of the ($1+1$) ES described in Sect. 2.1.1. The corresponding jar file can be downloaded from the workshop's web site.

The JAVA (1+1)-ES algorithm uses the parameters from Tab. 2.

Table 2: JAVA ( $1+1$)-ES: Parameters as reported by the algorithm

The (1+1)-ES can be started using the jar file from the command line with the following arguments.

java -jar simpleOnePlusOneES.jar 1 100 1.0E-6 
     de.fhkoeln.spot.objectivefunctions.Ball 
     3 "c(1.0,1.0,1.0)" 1.0 1.2239 3 0 2

The following command-line parameters were used:

1. seed = 1;
2. the algorithm has a budget of one hundred function evaluations;
3. it terminates, if the function value is smaller than 1e-6;
4. the sphere function is used as the objective function;
5. a three dimensional search space is used;
6. $(1,1,1)$ was chosen as the starting point;
7. the initial step size was set to one;
8. as a step size multiplier, the value $1.2239$ was chosen;
9. the history length was set to three;
10. no information about individuals is printed;
11. and the best objective function value is reported at the end.

This algorithm run produces the following output:

1 0.3732544130302741
13 0.2268318386083562
20 0.19052464589633564
25 0.17090575193950355
31 0.14554127695687402
37 0.08943630492465122
38 0.07890216216826802
47 0.07318808722843884
53 0.0573032759515119
61 0.001451451919883614
68 0.0010101618142669604
79 1.89432721043702E-4
93 8.645160644753755E-5