Sciweavers

Share
GECCO
2007
Springer

Informative performance metrics for dynamic optimisation problems

9 years 8 months ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but do not indicate any specific aspects of the performance. In this paper we split the offline error metric into two component parts. We propose a new metric to measure convergence speed, and show how this, when combined with a population diversity metric, correlates strongly with the overall performance. We then use these metrics to analyse several optimisation algorithms, yielding new insight into both the test function and how the algorithms’ characteristics can be improved. Categories and Subject Descriptors G.1 [Numerical Analysis]: Optimisation; F.2.1 [Analysis of Algorithms and Problem Complexity]: Numerical Algorithms and Problems General Terms Algorithms Keywords Evolutionary Computation, Particle Swarms, Multimodal Function Optimisation, Dynamic Optimisation
Stefan Bird, Xiaodong Li
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where GECCO
Authors Stefan Bird, Xiaodong Li
Comments (0)
books