Performance of 8 different dynamic optimization algorithms on the Moving Peaks Benchmark (see references)

Description

Dataset with the performance of several dynamic optimization algorithms in the Moving Peaks Benchmark problem (see the source section). The MPB function can be configured according to some parameters such as the dimension, the change frequency and the severity of changes. The performance measure employed is the average offline error.

Usage

1

Format

A data frame with 220000 observations on the following 5 variables.

Algorithm

A factor with levels reactive-cs independent-cs mqso-both mqso-rand mqso-change mqso agents soriga that correspond to 8 different algorithms for dynamic optimization applied to the Moving Peaks Benchmark function.

Dim

A numeric vector with the dimension (number of input variables) of the MPB function.

CF

A numeric vector with the change frequency along the time, i.e. the number of evaluations of the fitness function after which a change of the location of the function maxima happens.

Severity

A numeric vector with the severity of a change when it occurs.

OffError

A numeric vector with the performance measure, in this case the offline error computed as the average of the offline errors just before every change.

Source

I.G. del Amo, D.A. Pelta. SRCS: a technique for comparing multiple algorithms under several factors in dynamic optimization problems, in: E. Alba, A. Nakib, P. Siarry (Eds.), Metaheuristics for Dynamic Optimization. Series: Studies in Computational Intelligence 433, Springer, Berlin/Heidelberg, 2012.

Examples

1
2
3