Boundary strategies for firefly algorithm analysed using CEC`17 benchmark

In this paper, we are presenting a comparison of few selected boundary strategies for two popular optimization algorithms. The Firefly Algorithm (FA) and its hybridized modification, the Firefly Particle Swarm Optimization (FFPSO). The problem of boundary constrained optimization was already extensively studied for well-known heuristic optimization Particle Swarm Optimization (PSO). This suggesting importance for similar research for other swarm-based algorithms, like FA. The recent CEC'17 benchmark suite is used for the performance comparison of the methods and the results are compared and tested for statistical significance. © ECMS Lars Nolle, Alexandra Burger, Christoph Tholen, Jens Werner, Jens WellhausenMinistry of Education, Youth and Sports of the Czech Republic within the National Sustainability Programme [LO1303 (MSMT-7778/2014)]; European Regional Development Fund under the Project CEBIA-Tech [CZ.1.05/2.1.00/03.0089]; Internal Grant Agency of Tomas Bata University [IGA/CebiaTech/2018/003]; COST (European Cooperation in Science Technology) [CA15140, IC1406]; A.I.Lab at the Faculty of Applied Informatics, Tomas Bata University in Zli