Scouting Firefly Algorithm and its Performance on Global Optimization Problems

For effective optimization, metaheuristics should maintain the proper balance between exploration and exploitation. However, the standard firefly algorithm (FA) posted some limitations in its exploration process that can eventually lead to premature convergence, affecting its performance and adding uncertainty to the optimization results. To address these constraints, this study introduces an additional novel search mechanism for the standard FA inspired by the behavior of the scout bee in the artificial bee colony (ABC) algorithm, termed the "Scouting FA". Specifically, fireflies stuck in the local optima will take directed extra random walks to escape toward the region of the optimum solution, thus improving convergence accuracy. Empirical findings on the five standard benchmark functions have validated the effects of this modification and revealed that Scouting FA is superior to its original version.

@article{Villaruz2023,
  title     = {Scouting Firefly Algorithm and its Performance on Global Optimization Problems},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {14},
  number    = {3},
  year      = {2023},
  publisher = {The Science and Information Organization},
  author    = {Jolitte A. Villaruz and Bobby D. Gerardo and Ariel O. Gamao and Ruji P. Medina},
  doi       = {10.14569/IJACSA.2023.0140350},
  url       = {https://doi.org/10.14569/IJACSA.2023.0140350}
}