论文信息 - Benchmarking the Pure Random Search on the Bi-objective BBOB-2016 Testbed

Benchmarking the Pure Random Search on the Bi-objective BBOB-2016 Testbed

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 family bbob-biobj test suite of the COCO platform. For each combination of function, dimension n, and instance of the test suite, 106 ⋅ n candidate solutions are sampled uniformly within the sampling box [-5,5]n.

[1] Anne Auger,et al. The Impact of Search Volume on the Performance of RANDOMSEARCH on the Bi-objective BBOB-2016 Test Suite , 2016, GECCO.

[2] Anne Auger,et al. COCO: The Experimental Procedure , 2016, ArXiv.

[3] Anne Auger,et al. COCO: Performance Assessment , 2016, ArXiv.

[4] Anne Auger,et al. COCO: a platform for comparing continuous optimizers in a black-box setting , 2016, Optim. Methods Softw..

[5] Samuel H. Brooks. A Discussion of Random Methods for Seeking Maxima , 1958 .

[6] Anne Auger,et al. Benchmarking the pure random search on the BBOB-2009 testbed , 2009, GECCO '09.

[7] Anne Auger,et al. COCO: The Bi-objective Black Box Optimization Benchmarking (bbob-biobj) Test Suite , 2016, ArXiv.

[8] Anne Auger,et al. Biobjective Performance Assessment with the COCO Platform , 2016, ArXiv.