Black-Box Optimization Benchmarking of Two Variants of the POEMS Algorithm on the Noiseless Testbed
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00171003" target="_blank" >RIV/68407700:21230/10:00171003 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Black-Box Optimization Benchmarking of Two Variants of the POEMS Algorithm on the Noiseless Testbed
Original language description
This paper presents benchmarking of a stochastic local search algorithm called Prototype Optimization with Evolved Improvement Steps (POEMS) on the BBOB 2010 noise-free functions testbed. An original version of the POEMS algorithm presented at BBOB 2009workshop is compared to a new variant using a pool of candidate prototypes. Experiments for 2D, 3D, 5D, 10D and 20D were done. Experimental results show that the new variant of POEMS performs better on several functions for lower dimensions. Both variants perform equally on the 20D problems.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 12th annual conference comp on Genetic and evolutionary computation
ISBN
978-1-4503-0073-5
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
ACM
Place of publication
New York
Event location
Portland, Oregon
Event date
Jul 7, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—