Kontaktujte nás | Jazyk: čeština English
Název: | Introducing the run support strategy for the bison algorithm | ||||||||||
Autor: | Kazíková, Anežka; Pluháček, Michal; Kadavý, Tomáš; Šenkeřík, Roman | ||||||||||
Typ dokumentu: | Článek ve sborníku (English) | ||||||||||
Zdrojový dok.: | Lecture Notes in Electrical Engineering. 2020, vol. 554, p. 272-282 | ||||||||||
ISSN: | 1876-1100 (Sherpa/RoMEO, JCR) | ||||||||||
Journal Impact
This chart shows the development of journal-level impact metrics in time
|
|||||||||||
ISBN: | 978-3-03-014906-2 | ||||||||||
DOI: | https://doi.org/10.1007/978-3-030-14907-9_27 | ||||||||||
Abstrakt: | Many state-of-the-art optimization algorithms stand against the threat of premature convergence. While some metaheuristics try to avoid it by increasing the diversity in various ways, the Bison Algorithm faces this problem by guaranteeing stable exploitation – exploration ratio throughout the whole optimization process. Still, it is important to ensure, that the newly discovered solutions can affect the overall optimization process. In this paper, we propose a new Run Support Strategy for the Bison Algorithm, that should enhance the utilization of newly discovered solutions, and should be suitable for both continuous and discrete optimization. © Springer Nature Switzerland AG 2020. | ||||||||||
Plný text: | https://link.springer.com/chapter/10.1007/978-3-030-14907-9_27 | ||||||||||
Zobrazit celý záznam |