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 条
  • [41] Parallel Combinatorial Optimization Heuristics with GPUs
    Rashid, Mohammad Harun
    Tao, Lixin
    2017 INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND INTELLIGENT CONTROLS (ISCSIC), 2017, : 118 - 123
  • [42] Quantifying Heuristics in the Ordinal Optimization Framework
    Shen, Zhen
    Zhao, Qian-Chuan
    Jia, Qing-Shan
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2010, 20 (04): : 441 - 471
  • [43] Optimization heuristics for the combinatorial auction problem
    Schwind, M
    Stockheim, T
    Rothlauf, F
    CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, : 1588 - 1595
  • [44] On the Generalization of Neural Combinatorial Optimization Heuristics
    Manchanda, Sahil
    Michel, Sofia
    Drakulic, Darko
    Andreoli, Jean-Marc
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2022, PT V, 2023, 13717 : 426 - 442
  • [45] Meta-heuristics for portfolio optimization
    Kyle Erwin
    Andries Engelbrecht
    Soft Computing, 2023, 27 : 19045 - 19073
  • [46] Comparison of Heuristics for Optimization of Association Rules
    Alsolami, Fawaz
    Amin, Talha
    Moshkov, Mikhail
    Zielosko, Beata
    Zabinski, Krzysztof
    FUNDAMENTA INFORMATICAE, 2019, 166 (01) : 1 - 14
  • [47] Parallel LAN/WAN heuristics for optimization
    Alba, E
    Luque, G
    Troya, JM
    PARALLEL COMPUTING, 2004, 30 (5-6) : 611 - 628
  • [48] HEURISTICS FOR THE GLOBAL OPTIMIZATION OF MICROPROGRAMS.
    Poe, Michael D.
    MICRO: Annual Microprogramming Workshop, 1980, : 13 - 12
  • [49] Comparison of heuristics for inhibitory rule optimization
    Alsolami, Fawaz
    Chikalov, Igor
    Moshkov, Mikhail
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS 18TH ANNUAL CONFERENCE, KES-2014, 2014, 35 : 378 - 387
  • [50] PSO Heuristics Algorithm for Portfolio Optimization
    Chen, Yun
    Zhu, Hanhong
    ADVANCES IN SWARM INTELLIGENCE, PT 1, PROCEEDINGS, 2010, 6145 : 183 - 190