Benchmarking the Borg algorithm on the Biobjective bbob-biobj Testbed - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Benchmarking the Borg algorithm on the Biobjective bbob-biobj Testbed

Dimo Brockhoff
Pascal Capetillo
Jonathan Hornewall
Raphael Walker


The Borg MOEA [8] is an optimization algorithm, designed to handle real-world problems of a multi objective and multimodal nature. In this report, we examine the effectiveness of Borg for solving optimization problems with only two objectives. To this end, we benchmark the performance of the algorithm on the bbob-biobj test suite via the COCO platform, comparing it to current state-of-the-art algorithms. The study uses standard values for all the parameters but one, as retrieved from The only parameter that varies between different problem instances is the ε parameter, a crucial scale tuning parameter. To adapt this parameter, we devised and applied a heuristic. We find that the algorithm performs respectably, although it does not surpass the current state-of-the-art algorithms for any of the problem instances examined, and particularly loses performance on problems with a high-dimensional search space. Additionally, we observed that our heuristic for tuning the ε-parameter results in significant performance improvements compared to using a fixed value for ε.
No file

Dates and versions

hal-04403663 , version 1 (18-01-2024)




Dimo Brockhoff, Pascal Capetillo, Jonathan Hornewall, Raphael Walker. Benchmarking the Borg algorithm on the Biobjective bbob-biobj Testbed. GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation, Jul 2023, Lisbon Portugal, France. pp.1587-1594, ⟨10.1145/3583133.3596386⟩. ⟨hal-04403663⟩
18 View
0 Download



Gmail Mastodon Facebook X LinkedIn More