Name
Abstract | ||
|---|---|---|
ABSTRACTWe 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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3321707.3321868 | Genetic and Evolutionary Computation Conference |
Keywords | Field | DocType |
mixed-integer optimization, benchmarking, test function suite, the COCO platform | Integer,Decision variables,Discretization,Mathematical optimization,Suite,Computer science,Optimization algorithm,Benchmarking,Scalability | Conference |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tea Tusar | 1 | 181 | 19.91 |
| Dimo Brockhoff | 2 | 948 | 53.97 |
| Nikolaus Hansen | 3 | 723 | 51.44 |