Three Steps to Improve Jellyfish Search Optimiser

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F21%3AA22029ZE" target="_blank" >RIV/61988987:17310/21:A22029ZE - isvavai.cz</a>
Result on the web
<a href="https://mendel-journal.org/index.php/mendel/article/view/130" target="_blank" >https://mendel-journal.org/index.php/mendel/article/view/130</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.13164/mendel.2021.1.029" target="_blank" >10.13164/mendel.2021.1.029</a>

Result language
angličtina
Original language name
Three Steps to Improve Jellyfish Search Optimiser
Original language description
This paper describes three different mechanisms used in Jellysh Search (JS) optimiser. At first, an archive of good old solutions is used to prevent getting stuck in the local-optima area. Further, a distribution coefficient beta is adapted during the search process to control population diversity. Finally, an Eigen transformation of individuals in the reproduction process is used occasionally to cope with rotated functions. Three proposed variants of the JS optimiser are compared with the original JS algorithm and nine various well-known Nature-inspired optimisation methods when solving real-world problems of CEC 2011. Provided results achieved by statistical comparison show efficiency of the individual newly employed mechanisms.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

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

Similar results(10)