4.6 Article

On Selection of a Benchmark by Determining the Algorithms' Qualities

期刊

IEEE ACCESS
卷 9, 期 -, 页码 51166-51178

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2021.3058285

关键词

Benchmark testing; Optimization; Sociology; Licenses; Evolutionary computation; Measurement; Writing; Evolutionary algorithms; benchmark functions; differential evolution

资金

  1. Slovenian Research Agency [J2-1731, L7-9421, P2-0041]
  2. Project PDE-GIR of the European Union's Horizon 2020 Research and Innovation Programme under the Marie Sklodowska-Curie [778035]
  3. Spanish Ministry of Science, Innovation and Universities (Computer Science National Program) of the Agencia Estatal de Investigacion [TIN2017-89275-R]
  4. European Funds EFRD (AEI/FEDER, UE) [TIN2017-89275-R]

向作者/读者索取更多资源

This article discusses how to fairly evaluate the quality of nature-inspired algorithms by selecting test benchmarks and the correlation between algorithm rankings and different benchmarks. The study shows that the selected benchmark can affect the ranking of a particular algorithm, leading to deviations in the order of best-performing algorithms on different benchmarks.
The authors got the motivation for writing the article based on an issue, with which developers of the newly developed nature-inspired algorithms are usually confronted today: How to select the test benchmark such that it highlights the quality of the developed algorithm most fairly? In line with this, the CEC Competitions on Real-Parameter Single-Objective Optimization benchmarks that were issued several times in the last decade, serve as a testbed for evaluating the collection of nature-inspired algorithms selected in our study. Indeed, this article addresses two research questions: (1) How the selected benchmark affects the ranking of the particular algorithm, and (2) If it is possible to find the best algorithm capable of outperforming all the others on all the selected benchmarks. Ten outstanding algorithms (also winners of particular competitions) from different periods in the last decade were collected and applied to benchmarks issued during the same time period. A comparative analysis showed that there is a strong correlation between the rankings of the algorithms and the benchmarks used, although some deviations arose in ranking the best algorithms. The possible reasons for these deviations were exposed and commented on.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据