4.6 Article

A new and efficient firefly algorithm for numerical optimization problems

期刊

NEURAL COMPUTING & APPLICATIONS
卷 31, 期 5, 页码 1445-1453

出版社

SPRINGER LONDON LTD
DOI: 10.1007/s00521-018-3449-6

关键词

Firefly algorithm; Convergence speed; Attraction; Adaptive parameter

资金

  1. project of the First-Class University and the First-Class Discipline [10301-017004011501]
  2. National Natural Science Foundation of China

向作者/读者索取更多资源

Firefly algorithm (FA) is an excellent global optimizer based on swarm intelligence. Some recent studies show that FA was used to optimize various engineering problems. However, there are some drawbacks for FA, such as slow convergence rate and low precision solutions. To tackles these issues, a new and efficient FA (namely NEFA) is proposed. In NEFA, three modified strategies are employed. First, a new attraction model is used to determine the number of attracted fireflies. Second, a new search operator is designed for some better fireflies. Third, the step factor is dynamically updated during the iterations. Experiment verification is carried out on ten famous benchmark functions. Experimental results demonstrate that our new approach NEFA is superior to three other different versions of FA.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据