Benchmarking discrete optimization heuristics with IOHprofiler

被引:41
作者
Doerr, Carola [1 ]
Ye, Furong [2 ]
Horesh, Naama [3 ]
Wang, Hao [2 ]
Shir, Ofer M. [3 ,4 ]
Back, Thomas [2 ]
机构
[1] Sorbonne Univ, CNRS, LIP6, Paris, France
[2] Leiden Inst Adv Comp Sci, Leiden, Netherlands
[3] Migal Galilee Res Inst, Upper Galilee, Israel
[4] Tel Hai Coll, Comp Sci Dept, Upper Galilee, Israel
关键词
Combinatorial optimization; Black-box optimization; Randomized search heuristics; Benchmarking; Evolutionary computation; BLACK-BOX COMPLEXITY; ISING-MODEL; FRAMEWORK; SEARCH;
D O I
10.1016/j.asoc.2019.106027
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页数:21
相关论文
共 75 条
[1]   The query complexity of a permutation-based variant of Mastermind [J].
Afshani, Peyman ;
Agrawal, Manindra ;
Doerr, Benjamin ;
Doerr, Carola ;
Larsen, Kasper Green ;
Mehlhorn, Kurt .
DISCRETE APPLIED MATHEMATICS, 2019, 260 :28-50
[2]  
[Anonymous], ARXIV160308785 CORR
[3]  
[Anonymous], 2016, OPTIMIZATION BENCHMA
[4]  
[Anonymous], ARXIV11015015
[5]  
[Anonymous], 2018, ARXIV181005281
[6]  
[Anonymous], ARXIV181111597 CORR
[7]  
[Anonymous], CORR
[8]  
[Anonymous], P GEN EV COMP C GECC
[9]  
[Anonymous], IMPL BB DOB GECCO WO
[10]  
[Anonymous], ARXIV180102037 CORR