Premium
An efficient firefly algorithm based on modified search strategy and neighborhood attraction
Author(s) -
Yu Gan,
Wang Hui,
Zhou Hongzhi,
Zhao Shasha,
Wang Ya
Publication year - 2021
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.22462
Subject(s) - firefly algorithm , dimension (graph theory) , euclidean distance , mathematical optimization , convergence (economics) , computer science , attraction , swarm intelligence , attractiveness , swarm behaviour , algorithm , process (computing) , particle swarm optimization , mathematics , artificial intelligence , psychology , linguistics , philosophy , psychoanalysis , pure mathematics , economics , economic growth , operating system
Firefly algorithm (FA) is a popular swarm intelligence optimization algorithm. Though FA was employed to solve various optimization problems, it still has some deficiencies, such as high complexity, slow convergence rate, and low precision of solutions. To tackle these issues, this paper proposes an efficient FA based on modified search strategy and neighborhood attraction (namely MSSNaFA). In MSSNaFA, there are four main modifications. First, a novel search strategy based on dimension differences is designed. The attractiveness in the original FA is related to the Euclidean distance, while our new method uses the differences of each dimension for two fireflies to compute the attractiveness. Then, a modified neighborhood attraction mechanism is utilized to reduce the computational complexity. When the current solution is selected, it will move to the global best solution based on the new movement strategy. Third, for each firefly, three neighborhood search operations are carried out based on a preset probability. Lastly, the step factor is adaptively adjusted in the search process. Performance validation between MSSNaFA and four other FA variants show the effectiveness of our approach.