4.1 Article

An Exploratory Landscape Analysis-Based Benchmark Suite

Journal

ALGORITHMS
Volume 14, Issue 3, Pages -

Publisher

MDPI
DOI: 10.3390/a14030078

Keywords

exploratory landscape analysis; benchmarking; algorithm selection problem; sample size; single-objective boundary-constrained continuous optimization problems; black-box optimization

Ask authors/readers for more resources

This study introduces a method to determine the minimum sample size required for robust exploratory landscape analysis measures, and utilizes self-organizing feature map to cluster a comprehensive set of benchmark functions, proposing a benchmark suite with improved coverage in single-objective, boundary-constrained problem spaces.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.1
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available