.png){kind=icon}
返回
An improved firefly algorithm for numerical optimization problems and it's application in constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s00366-021-01412-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Metaheuristic algorithms are successful methods of optimization. The firefly algorithm is one of the known metaheuristic algorithms used in a variety of applications. Recently, a new and efficient version of this algorithm was introduced as NEFA, which indicated a good performance in solving optimization problems. However, the introduced attraction model in this algorithm may not provide good coverage of the search space and thus trap the algorithm in a local optimum. In this paper, a new and efficient improved firefly algorithm called INEFA is proposed to improve the performance of NEFA. In INEFA, a new model of attraction is introduced in which each firefly can be attracted to brighter fireflies located in different areas of the search space, using the clustering concept to classify fireflies. To evaluate the performance of INEFA, it was used to optimize several known benchmark functions. The results were compared with the results of the firefly algorithm and some of its known improvements. The comparison of results indicated the significant power of INEFA compared to the algorithms. It was used to evaluate its application in solving a constrained optimization problem. The comparison results showed that INEFA performs better than most of the compared algorithms.
Keyword:
Firefly algorithm
Attraction model
Clustering
Mutation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.9
论文数:
2.7K
被引数:
9.3K
机构
引用论文
.png){kind=icon}
分享收藏A hybrid optimizer based on firefly algorithm and particle swarm optimization algorithm基于萤火虫算法和粒子群算法的混合优化器
PREAI
分享收藏
查看更多内容