Please use this identifier to cite or link to this item:
Title: An accurate partially attracted firefly algorithm
Authors: Zhou, Lingyun
Ding, Lixin
Ma, Maode
Tang, Wan
Keywords: Engineering::Computer science and engineering
Issue Date: 2018
Source: Zhou, L., Ding, L., Ma, M., & Tang, W. (2019). An accurate partially attracted firefly algorithm. Computing, 101(5), 477-493. doi:10.1007/s00607-018-0645-2
Journal: Computing
Abstract: 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.
ISSN: 0010-485X
DOI: 10.1007/s00607-018-0645-2
Schools: School of Electrical and Electronic Engineering 
Rights: © 2018 Springer-Verlag GmbH Austria, part of Springer Nature. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Journal Articles

Citations 20

Updated on Jun 9, 2024

Web of ScienceTM
Citations 20

Updated on Oct 27, 2023

Page view(s)

Updated on Jun 11, 2024

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.