The Impact of Search Volume on the Performance of RANDOMSEARCH on the Bi-objective BBOB-2016 Test Suite - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

The Impact of Search Volume on the Performance of RANDOMSEARCH on the Bi-objective BBOB-2016 Test Suite

Résumé

Pure random search is undeniably the simplest stochastic search algorithm for numerical optimization. Essentially the only thing to be determined to implement the algorithm is its sampling space, the influence of which on the performance on the bi-objective bbob-biobj test suite of the COCO platform is investigated here. It turns out that the suggested region of interest of [−100, 100] n (with n being the problem dimension) has a too vast volume for the algorithm to approximate the Pareto set effectively. Better performance can be achieved if solutions are sampled uniformly within [−5, 5] n or [−4, 4] n. The latter sampling box corresponds to the smallest hypercube encapsulating all single-objective optima of the 55 constructed bi-objective problems of the bbob-biobj test suite. However, not all best known Pareto set approximations are entirely contained within [−5, 5] n .
Fichier principal
Vignette du fichier
wk0812-auger-RScomp-authorversion.pdf (4.56 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01435453 , version 1 (14-01-2017)

Identifiants

Citer

Anne Auger, Dimo Brockhoff, Nikolaus Hansen, Dejan Tušar, Tea Tušar, et al.. The Impact of Search Volume on the Performance of RANDOMSEARCH on the Bi-objective BBOB-2016 Test Suite. GECCO 2016 - Genetic and Evolutionary Computation Conference, Jul 2016, Denver, CO, United States. pp.1257 - 1264, ⟨10.1145/2908961.2931709⟩. ⟨hal-01435453⟩
548 Consultations
185 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More