Skip to content
Book Open access

Hot off the Press: BONO-Bench: A Comprehensive Test Suite for Bi-objective Numerical Optimization with Traceable Pareto Sets

Lennart Schäpermeier P. Kerschke
Jul 2026 · Proceedings of the Genetic and Evolutionary Computation Conference Companion · pp. 83-84 · 0 citations · 11 references

TL;DR

BONO-Bench is presented, a recently proposed problem generator and benchmark set for bi-objective numerical optimization that enables best practices for empirical runtime analysis of optimizers using reference solutions that can be approximated to an arbitrary degree, resulting in precise target values for the hypervolume and exact R2 indicators.

Abstract

The evaluation of heuristic optimizers on test problems, better known as benchmarking, is a cornerstone of research in multiobjective optimization. However, many frequently used test problems either feature a limited degree of optimization challenges or have poorly understood reference solutions. Here, we present an overview of BONO-Bench [5], a recently proposed problem generator and benchmark set for bi-objective numerical optimization. Building on convex-quadratic problems, it features diverse challenges ranging from different levels of conditioning, shapes of Pareto set and front as well as plateaus to different structured and unstructured multimodality patterns. Furthermore, we enable best practices for empirical runtime analysis of optimizers using reference solutions that can be approximated to an arbitrary degree, resulting in precise target values for the hypervolume and exact R2 indicators.

Read PDF

Similar papers

Book Open access Jul 2026

Hot off the Press: Pareto-Optimal Fronts for Benchmarking Symbolic Regression Algorithms

This work constructs APO fronts for 34 datasets from SRBench by exhaustively searching over short symbolic expressions and by fitting numerical constants with eight commonly used local optimization methods, and finds that the final fronts are relatively stable across numerical optimizers, suggesting that structural sea...

Kei Sen Fong, M. Motani · 0 citations
Book Open access Jul 2026

On Reference Set Selection for Constrained Multiobjective Optimization Problems

This paper investigates and compares six strategies for reference set construction in constrained bi-objective problems from a recently proposed test problem generator and concludes that the choice of strategy should depend on the intended goal, with the approach that aims to maximize the hypervolume indicator value st...

Luka Opravš, D. Brockhoff, T. Tušar · 0 citations
Book Open access Jul 2026

Not All Problems Are Equal: Weighted Performance Profiles For Many-Objective Optimization

By employing a difficulty-aware weighting scheme, the approach biases aggregation toward higher-dimensional instances, enabling a more discriminative assessment of scalability, robustness, and performance.

Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al. · 0 citations
Book Open access Jul 2026

Hot off the Press: Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem

EDO is analyzed on a three-objective function LOTZk, which is a modification of the two-objective benchmark function (LeadingOnes, TrailingZeros), and it is proved that the GSEMO computes a set of all Pareto-optimal solutions in O(kn3) expected iterations.

D. Antipov, Aneta Neumann, Frank Neumann et al. · 0 citations
Book Open access Jul 2026

Hot of the Press: A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update

A rigorous runtime analysis of NSGA-III on the many-objective OneJumpZeroJump benchmark, providing runtime bounds where the number of objectives is constant and a stochastic population update provably guarantees a speedup of order Θ((k/b)k-1) in the runtime where b > 0 is a constant.

Andre Opris · 11 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.