Publ3 search

Z6_60GI02O0O8IDC0QEJUJ26TJDI4

Error:

Javascript is disabled in this browser. This page requires Javascript. Modify your browser's settings to allow Javascript to execute. See your browser's documentation for specific instructions.

Publikační činnost

Probíhá načítání, čekejte prosím...

Record type:	stať ve sborníku (D)
Home Department:	Katedra informatiky a počítačů (31400)
Title:	On the Efficiency of Successful-Parent Selection Framework in the State-of-the-art Differential Evolution Variants
Citace	Bujok, P. On the Efficiency of Successful-Parent Selection Framework in the State-of-the-art Differential Evolution Variants. In: 16th International Conference on Artificial Intelligence and Soft Computing: LNAI 10245 Artificial Intelligence and Soft Computing - Part I 2017-06-11 Zakopane, Polsko. New York: Springer, 2017. s. 327-336. ISBN 978-3-319-59063-9.

Subtitle
Publication year:	2017
Obor:	Informatika
Number of pages:	10
Page from:	327
Page to:	336
Form of publication:	Paměťový nosič
ISBN code:	978-3-319-59063-9
ISSN code:
Proceedings title:	LNAI 10245 Artificial Intelligence and Soft Computing - Part I
Proceedings:	Mezinárodní
Publisher name:	Springer
Place of publishing:	New York
Country of Publication:	Sborník vydaný v zahraničí
Název konference:	16th International Conference on Artificial Intelligence and Soft Computing
Místo konání konference:	Zakopane, Polsko
Datum zahájení konference:
Typ akce podle státní příslušnosti účastníků:	Celosvětová akce
WoS code:
EID:	2-s2.0-85020919083

Key words in English:	global optimization, differential evolution, successful-parent selection, experimental comparison, CEC 2014 test suite
Annotation in original language:	Successful-parent selection (SPS) framework in differential evolution (DE) is studied. two SPS versions (SPS1 proposed recently in literature and SPS2 newly proposed in this paper) are applied to seven state-of-the-art DE variants. The algorithms are compared experimentally on CEC 2014 test suite used as a benchmark. The application of SPS1 increases the efficiency of two DE algorithms in over 50 % of test problems. An overall comparison shows that the newly proposed SPS2 performs well only in two cases whereas SPS1 outperforms six out of 7 original algorithms.
Annotation in english language:

References

Reference

R01:	RIV/61988987:17310/17:A1801N00

Complementary Content

${loading}