Benchmarking discrete optimization heuristics with IOHprofiler

被引:34
|
作者
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
相关论文
共 50 条
  • [21] MILP-based discrete sizing and topology optimization of truss structures: new formulation and benchmarking
    Brutting, Jan
    Senatore, Gennaro
    Fivet, Corentin
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2022, 65 (10)
  • [22] MILP-based discrete sizing and topology optimization of truss structures: new formulation and benchmarking
    Jan Brütting
    Gennaro Senatore
    Corentin Fivet
    Structural and Multidisciplinary Optimization, 2022, 65
  • [23] Finance-based scheduling using meta-heuristics: discrete versus continuous optimization problems
    Elazouni, Ashraf
    Alghazi, Anas
    Selim, Shokri
    JOURNAL OF FINANCIAL MANAGEMENT OF PROPERTY AND CONSTRUCTION, 2015, 20 (01) : 85 - +
  • [24] Polynomial Heuristics for Query Optimization
    Bruno, Nicolas
    Galindo-Legaria, Cesar
    Joshi, Milind
    26TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING ICDE 2010, 2010, : 589 - 600
  • [25] Problem Solving Heuristics, Affect, and Discrete Mathematics
    Goldin G.A.
    ZDM, 2004, 36 (2) : 56 - 60
  • [26] Using Heuristics to Automate Parameter Generation for Benchmarking of Java']Java Methods
    Kuperberg, Michael
    Omri, Fouad
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 253 (01) : 57 - 75
  • [27] Correction: MILP-based discrete sizing and topology optimization of truss structures: new formulation and benchmarking
    Jan Brütting
    Gennaro Senatore
    Corentin Fivet
    Structural and Multidisciplinary Optimization, 2022, 65
  • [28] Benchmarking optimization solvers for structural topology optimization
    Rojas-Labanda, Susana
    Stolpe, Mathias
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2015, 52 (03) : 527 - 547
  • [29] Benchmarking optimization solvers for structural topology optimization
    Susana Rojas-Labanda
    Mathias Stolpe
    Structural and Multidisciplinary Optimization, 2015, 52 : 527 - 547
  • [30] Inspirations for Optimization based on Benchmarking
    Xie, A. S.
    Liu, D. X.
    PROCEEDINGS OF THE 2017 INTERNATIONAL SEMINAR ON ARTIFICIAL INTELLIGENCE, NETWORKING AND INFORMATION TECHNOLOGY (ANIT 2017), 2017, 150 : 174 - 178