Benchmarking the Pure Random Search on the Bi-objective BBOB-2016 Testbed
Résumé
The Comparing Continuous Optimizers platform COCO has become a standard for benchmarking numerical (single-objective) optimization algorithms effortlessly. In 2016, COCO has been extended towards multi-objective optimization by providing a first bi-objective test suite. To provide a baseline, we benchmark a pure random search on this bi-objective bbob-biobj test suite of the COCO platform. For each combination of function, dimension n, and instance of the test suite, $10^6 · n$ candidate solutions are sampled uniformly within the sampling box $[−5, 5]^n$ .
Origine | Fichiers produits par l'(les) auteur(s) |
---|