Mixed-Integer Benchmark Problems for Single-and Bi-Objective Optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Mixed-Integer Benchmark Problems for Single-and Bi-Objective Optimization

Abstract

We introduce two suites of mixed-integer benchmark problems to be used for analyzing and comparing black-box optimization algorithms. They contain problems of diverse difficulties that are scalable in the number of decision variables. The bbob-mixint suite is designed by partially discretizing the established BBOB (Black-Box Optimization Benchmarking) problems. The bi-objective problems from the bbob-biobj-mixint suite are, on the other hand, constructed by using the bbob-mixint functions as their separate objectives. We explain the rationale behind our design decisions and show how to use the suites within the COCO (Comparing Continuous Optimizers) platform. Analyzing two chosen functions in more detail, we also provide some unexpected findings about their properties.
Fichier principal
Vignette du fichier
2019_GECCO_Mixint_Suites.pdf (6.05 Mo) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02067932 , version 1 (14-03-2019)

Identifiers

  • HAL Id : hal-02067932 , version 1

Cite

Tea Tušar, Dimo Brockhoff, Nikolaus Hansen. Mixed-Integer Benchmark Problems for Single-and Bi-Objective Optimization. GECCO 2019 -The Genetic and Evolutionary Computation Conference, Jul 2019, Prague, Czech Republic. ⟨hal-02067932⟩
260 View
1005 Download

Share

Gmail Mastodon Facebook X LinkedIn More