Experimental Comparison of Six Population Based Algorithms for Continuous Black Box Optimization

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00199147" target="_blank" >RIV/68407700:21230/12:00199147 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.mitpressjournals.org/doi/abs/10.1162/EVCO_a_00083" target="_blank" >http://www.mitpressjournals.org/doi/abs/10.1162/EVCO_a_00083</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Experimental Comparison of Six Population Based Algorithms for Continuous Black Box Optimization

Popis výsledku v původním jazyce

Six population based methods for real valued black box optimization are thoroughly compared in this article. One of them, Nelder Mead simplex search, is rather old, but still a popular technique of direct search. The remaining five (POEMS, G3PCX, CauchyEDA, BIPOP CMA ES, and CMA ES) are more recent and came from the evolutionary computation community. The recently proposed comparing continuous optimizers (COCO) methodology was adopted as the basis for the comparison. The results show that BIPOP CMA ESreaches the highest success rates and is often also quite fast. The results of the remaining algorithms are mixed, but Cauchy EDA and POEMS are usually slow.

Název v anglickém jazyce

Experimental Comparison of Six Population Based Algorithms for Continuous Black Box Optimization

Popis výsledku anglicky

Six population based methods for real valued black box optimization are thoroughly compared in this article. One of them, Nelder Mead simplex search, is rather old, but still a popular technique of direct search. The remaining five (POEMS, G3PCX, CauchyEDA, BIPOP CMA ES, and CMA ES) are more recent and came from the evolutionary computation community. The recently proposed comparing continuous optimizers (COCO) methodology was adopted as the basis for the comparison. The results show that BIPOP CMA ESreaches the highest success rates and is often also quite fast. The results of the remaining algorithms are mixed, but Cauchy EDA and POEMS are usually slow.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

JC - Počítačový hardware a software

OECD FORD obor

—

Projekt

<a href="/cs/project/GP102%2F08%2FP094" target="_blank" >GP102/08/P094: Metody strojového učení pro konstrukci řešení v evolučních algoritmech</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Evolutionary Computation

ISSN

1063-6560

e-ISSN

—

Svazek periodika

20

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

26

Strana od-do

483-508

Kód UT WoS článku

000311334400002

EID výsledku v databázi Scopus

—