4.6 Article

A novel hybrid dynamic fireworks algorithm with particle swarm optimization

期刊

SOFT COMPUTING
卷 25, 期 3, 页码 2371-2398

出版社

SPRINGER
DOI: 10.1007/s00500-020-05308-6

关键词

Fireworks algorithm; Dynamic explosion amplitude; Global best firework; Updating process; Particle swarm optimization

资金

  1. National Science Foundations of China [61976101, 61572224, 61304082, 41475017]
  2. National Science Found for Distinguished Young Schools [61425009]
  3. Anhui Provincial Natural Science Foundation [1708085MF140]
  4. Natural Science Foundation in colleges and universities of Anhui Province [KJ2019B16]

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

A dynamic fireworks algorithm with particle swarm optimization (DFWPSO) is proposed in this paper to enhance the global performance of FWA by dynamically adjusting explosion amplitude and implementing a new update mechanism; experimental results demonstrate the competitive and effective performance of the algorithm in solving optimization problems.
In recent years, the fireworks algorithm (FWA) has attracted more and more attention due to its strong ability to solve optimization problems. However, the global performance of FWA is significantly affected by the explosion amplitude. In this paper, a dynamic fireworks algorithm with particle swarm optimization (DFWPSO) is developed to improve the global performance of FWA. In DFWPSO, a dynamic explosion amplitude mechanism based on the evolution speed of population, which is dynamically adjusted by evaluating the evolution speed of fitness in each iteration process, is designed to control the global and local searching information. Moreover, a new nonlinear minimal amplitude check strategy based on function decreasing is designed to obtain appropriate amplitude. Furthermore, a new firework updating mechanism based on particle swarm optimization (PSO) is implemented to accelerate the convergence of algorithm and cut down on computing resources. In addition, the selection operator of FWA is abandoned and all fireworks are updated by velocity and current location in each iteration process. To verify the performance of the proposed DFWPSO algorithm, three groups of the benchmark functions are used and tested for experiments. Compared with other variants of FWA and PSO variants, results show that the proposed algorithm performs competitively and effectively.

作者

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

评论

主要评分

4.6
评分不足

次要评分

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

推荐

暂无数据
暂无数据