Abstract
This paper compares four different methods for handling the roaming behavior of fireflies in the firefly algorithm. The problems of boundary constrained optimization forces the algorithm to actively keep the fireflies inside the feasible area of possible solutions. 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.
Author supplied keywords
Cite
CITATION STYLE
Kadavy, T., Pluhacek, M., Viktorin, A., & Senkerik, R. (2018). Comparing boundary control methods for firefly algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10835 LNCS, pp. 163–173). Springer Verlag. https://doi.org/10.1007/978-3-319-91641-5_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
