4.7 Article

Benchmarking discrete optimization heuristics with IOHprofiler

期刊

APPLIED SOFT COMPUTING
卷 88, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2019.106027

关键词

Combinatorial optimization; Black-box optimization; Randomized search heuristics; Benchmarking; Evolutionary computation

资金

  1. Chinese scholarship council (CSC) [201706310143]
  2. Investissement d'avenir project [ANR-11-LABX-0056LMH]
  3. LabEx LMH
  4. Paris Ile-de-France Region
  5. COST Action [CA15140]

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

Automated benchmarking environments aim to support researchers in understanding how different algorithms perform on different types of optimization problems. Such comparisons provide insights into the strengths and weaknesses of different approaches, which can be leveraged into designing new algorithms and into the automation of algorithm selection and configuration. With the ultimate goal to create a meaningful benchmark set for iterative optimization heuristics, we have recently released IOHprofiler, a software built to create detailed performance comparisons between iterative optimization heuristics. With this present work we demonstrate that IOHprofiler provides a suitable environment for automated benchmarking. We compile and assess a selection of 23 discrete optimization problems that subscribe to different types of fitness landscapes. For each selected problem we compare performances of twelve different heuristics, which are as of now available as baseline algorithms in IOHprofiler. We also provide a new module for IOHprofiler which extents the fixed-target and fixed-budget results for the individual problems by ECDF results, which allows one to derive aggregated performance statistics for groups of problems. (C) 2019 Elsevier B.V. All rights reserved.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据