Rodrigues, Douglasde Rosa, Gustavo Henrique [UNESP]Passos, Leandro AparecidoPapa, João Paulo [UNESP]2022-04-302022-04-302020-01-01Studies in Computational Intelligence, v. 855, p. 1-21.1860-95031860-949Xhttp://hdl.handle.net/11449/232905In the last few years, meta-heuristic-driven optimization algorithms have been employed to solve several problems since they can provide simple and elegant solutions. In this work, we introduced an improved adaptive version of the Flower Pollination Algorithm, which can dynamically change its parameter setting throughout the convergence process, as well as it keeps track of the best solutions. The effectiveness of the proposed approach is compared against with Bat Algorithm and Particle Swarm Optimization, as well as the naïve version of the Flower Pollination Algorithm. The experimental results were carried out in nine benchmark functions available in literature and demonstrated to outperform the other techniques with faster convergence rate.1-21engBenchmarking functionsFlower pollination algorithmMeta-heuristic algorithmsOptimizationCapítulo de livro10.1007/978-3-030-28553-1_12-s2.0-85072069070