Next Article in Journal
An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks
Next Article in Special Issue
Towards Understanding Clustering Problems and Algorithms: An Instance Space Analysis
Previous Article in Journal
Multi-Objective Task Scheduling Optimization in Spatial Crowdsourcing
Previous Article in Special Issue
A Survey of Advances in Landscape Analysis for Optimisation
Article

An Exploratory Landscape Analysis-Based Benchmark Suite

1
Computer Science Division, Stellenbosch University, Stellenbosch 7600, South Africa
2
Department of Industrial Engineering and Computer Science Division, Stellenbosch University, Stellenbosch 7600, South Africa
*
Author to whom correspondence should be addressed.
Academic Editors: Mario A. Muñoz and Katherine Malan
Algorithms 2021, 14(3), 78; https://doi.org/10.3390/a14030078
Received: 30 November 2020 / Revised: 13 February 2021 / Accepted: 22 February 2021 / Published: 27 February 2021
The choice of which objective functions, or benchmark problems, should be used to test an optimization algorithm is a crucial part of the algorithm selection framework. Benchmark suites that are often used in the literature have been shown to exhibit poor coverage of the problem space. Exploratory landscape analysis can be used to quantify characteristics of objective functions. However, exploratory landscape analysis measures are based on samples of the objective function, and there is a lack of work on the appropriate choice of sample size needed to produce reliable measures. This study presents an approach to determine the minimum sample size needed to obtain robust exploratory landscape analysis measures. Based on reliable exploratory landscape analysis measures, a self-organizing feature map is used to cluster a comprehensive set of benchmark functions. From this, a benchmark suite that has better coverage of the single-objective, boundary-constrained problem space is proposed. View Full-Text
Keywords: exploratory landscape analysis; benchmarking; algorithm selection problem; sample size; single-objective boundary-constrained continuous optimization problems; black-box optimization exploratory landscape analysis; benchmarking; algorithm selection problem; sample size; single-objective boundary-constrained continuous optimization problems; black-box optimization
Show Figures

Figure 1

MDPI and ACS Style

Lang, R.D.; Engelbrecht, A.P. An Exploratory Landscape Analysis-Based Benchmark Suite. Algorithms 2021, 14, 78. https://doi.org/10.3390/a14030078

AMA Style

Lang RD, Engelbrecht AP. An Exploratory Landscape Analysis-Based Benchmark Suite. Algorithms. 2021; 14(3):78. https://doi.org/10.3390/a14030078

Chicago/Turabian Style

Lang, Ryan D., and Andries P. Engelbrecht. 2021. "An Exploratory Landscape Analysis-Based Benchmark Suite" Algorithms 14, no. 3: 78. https://doi.org/10.3390/a14030078

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop