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.
Document type :
Conference papers
Complete list of metadatas

Contributor : Dimo Brockhoff <>
Submitted on : Thursday, March 14, 2019 - 2:41:23 PM
Last modification on : Friday, April 12, 2019 - 1:31:47 AM


Files produced by the author(s)


  • HAL Id : hal-02067932, version 1


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



Record views


Files downloads