A Comparison of Several Algorithms and Representations for Single Objective Optimization

Crina Grosan

Abstract. In this paper we perform two experiments. In the first experiment we analyze the convergence ability to using different base for encoding solutions. For this purpose we use the bases 2 to 16. We apply the same algorithm (with the same basic parameters) for all considered bases of representation and for all considered test functions. The algorithm is an (1+1) ES. In the second experiment we will perform a comparison between three algorithms which use different bases for solution representation. Each of these algorithms uses a dynamic representation of the solutions in the sense that the representation is not fixed and is changed during the search process. The difference between these algorithms consists in the technique adopted for changing the base over which the solution is represented. These algorithms are: Adaptive Representation Evolutionary Algorithms (AREA) [1], Dynamic Representation Evolution Strategy (DRES) and Seasonal Model Evolution Strategy (SMES) [2].

LNCS 3102, p. 788 f.

Full article in PDF

lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2004