.png){kind=icon}
Return
An accurate partially attracted firefly algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-018-0645-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The firefly algorithm (FA) is a new and powerful algorithm for optimization. However, it has the disadvantages of high computational complexity and low convergence accuracy, especially when solving complex problems. In this paper, an accurate partially attracted firefly algorithm (PaFA) is proposed by adopting a partial attraction model and a fast attractiveness calculation strategy. The partial attraction model can preserve swarm diversity and make full use of individual information. The fast attractiveness calculation strategy ensures information sharing among the individuals and it also improves the convergence accuracy. The experimental results demonstrate the good performance of PaFA in terms of the solution accuracy compared with two state-of-the-art FA variants and two other bio-inspired algorithms.
Keywords:
Firefly algorithm
Partial attraction model
Fast attractiveness calculation
Optimization
68T20
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
2.8
Papers:
2.3K
Citations:
3.5K
Organization
Cited Papers
Randomly attracted firefly algorithm with neighborhood search and dynamic parameter adjustment mechanism.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
ShareSaveShareSaveShareSaveShareSave
View more