Towards improved benchmarking of black-box optimization algorithms using clustering problems

Gallagher, Marcus (2016) Towards improved benchmarking of black-box optimization algorithms using clustering problems. Soft Computing, 20 10: 1-15. doi:10.1007/s00500-016-2094-1

Author Gallagher, Marcus
Title Towards improved benchmarking of black-box optimization algorithms using clustering problems
Journal name Soft Computing   Check publisher's open access policy
ISSN 1433-7479
Publication date 2016-03-10
Year available 2016
Sub-type Article (original research)
DOI 10.1007/s00500-016-2094-1
Open Access Status Not Open Access
Volume 20
Issue 10
Start page 1
End page 15
Total pages 15
Place of publication Heidelberg, Germany
Publisher Springer
Language eng
Subject 2614 Theoretical Computer Science
1712 Software
2608 Geometry and Topology
Abstract The field of Metaheuristics has produced a large number of algorithms for continuous, black-box optimization. In contrast, there are few standard benchmark problem sets, limiting our ability to gain insight into the empirical performance of these algorithms. Clustering problems have been used many times in the literature to evaluate optimization algorithms. However, much of this work has occurred independently on different problem instances and the various experimental methodologies used have produced results which are frequently incomparable and provide little knowledge regarding the difficulty of the problems used, or any platform for comparing and evaluating the performance of algorithms. This paper discusses sum of squares clustering problems from the optimization viewpoint. Properties of the fitness landscape are analysed and it is proposed that these problems are highly suitable for algorithm benchmarking. A set of 27 problem instances (from 4-D to 40-D), based on three well-known datasets, is specified. Baseline experimental results are presented for the Covariance Matrix Adaptation-Evolution Strategy and several other standard algorithms. A web-repository has also been created for this problem set to facilitate future use for algorithm evaluation and comparison.
Keyword Algorithm benchmarking
Continuous black-box optimization
Fitness landscape analysis
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status UQ

Document type: Journal Article
Sub-type: Article (original research)
Collections: HERDC Pre-Audit
School of Information Technology and Electrical Engineering Publications
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 1 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 1 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 22 Mar 2016, 10:23:38 EST by System User on behalf of Learning and Research Services (UQ Library)