Competition of Strategies in jSO Algorithm

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F19%3AA2002058" target="_blank" >RIV/61988987:17310/19:A2002058 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-030-37838-7_11" target="_blank" >http://dx.doi.org/10.1007/978-3-030-37838-7_11</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-37838-7_11" target="_blank" >10.1007/978-3-030-37838-7_11</a>

Result language
angličtina
Original language name
Competition of Strategies in jSO Algorithm
Original language description
A newly proposed variant of the efficient jSO algorithm employing competition of eight strategies (cSO) is proposed. The main idea is to select the most proper strategy and adapt the setting to each solved problem. One more mutation variant and one more type of crossover are added to jSO, and moreover, the popular mechanism of Eigen coordi- nate system is applied. All eight strategies compete to be used in the next generations based on the successes in previous generations. The proposed cSO method has more wins over jSO significantly in more real-world problems than fails. The original jSO strategy is never the most frequently used strategy, compared with other newly employed strategies.
Czech name
—
Czech description
—

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

Article name in the collection
Communications in Computer and Information Science, vol 1092
ISBN
978-3-030-37837-0
ISSN
1865-0929
e-ISSN
1865-0937
Number of pages
8
Pages from-to
113-121
Publisher name
Springer
Place of publication
Cham
Event location
Maribor, Slovinsko
Event date
Jul 10, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)