L-SHADE with Competing Strategies Applied to Constrained Optimization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17610%2F17%3AA1801LYD" target="_blank" >RIV/61988987:17610/17:A1801LYD - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
L-SHADE with Competing Strategies Applied to Constrained Optimization
Original language description
An enhanced version of L-SHADE algorithm has been proposed recently. The LSHADE44 algorithm uses three different additional strategies for computing a trial point and employed strategies compete in the algorithm. The algorithm was originally developed for bound-constrained optimization. In this paper, the LSHADE44 algorithm was slightly simplified and modified to be able to solve constrained problems. The benchmark set arranged forCEC2017 competition on constrained real-parameter optimization is employed.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2017
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
2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings
ISBN
978-150904601-0
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
1683-1689
Publisher name
Institute of Electrical and Electronics Engineers Inc.
Place of publication
—
Event location
San Sebastian
Event date
Jun 5, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—