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.
CITATION STYLE
Kazikova, A., Pluhacek, M., Kadavy, T., & Senkerik, R. (2020). Introducing the run support strategy for the bison algorithm. In Lecture Notes in Electrical Engineering (Vol. 554, pp. 272–282). Springer Verlag. https://doi.org/10.1007/978-3-030-14907-9_27
Mendeley helps you to discover research relevant for your work.