G-2025-39
Cat-Suite: A collection of optimization problems with categorical and quantitative variables for benchmarking
, , , , and BibTeX reference
Benchmarking new optimization methods on test problems is essential for assessing their performance and tuning their parameters. Yet, few problems are available in the literature for mixed-variable optimization. This manuscript introduces Cat-Suite, a collection of optimization problems involving categorical, integer, and continuous variables. Currently, Cat-Suite includes 32 analytical problems, half of which are constrained and half unconstrained. Each of these problems is either a modification of an existing one from the literature or derived from classical continuous test functions, such as Rosenbrock. Cat-Suite is an ongoing project, and additional problems will be added in the future. The goal is to facilitate benchmarking and testing of novel mixed-variable optimization methods with a diverse problem collection. The problems are implemented in Python and available at https://github.com/bbopt/Cat-Suite.
Published June 2025 , 20 pages
Research Axis
Research application
Document
G2539.pdf (500 KB)