An improved fireworks algorithm

To address the shortcomings of the traditional fireworks algorithm (FW A) in the process of finding the optimal solution, an improved fireworks algorithm with randomization is proposed. Firstly, dynamic switching variation is performed according to the position relationship between the firework explosion operators to increase the diversity of operators of FWA. Secondly, the spark particles beyond the boundary are randomization mapping back into the feasible domain due to randomness. Therefore.j it is convenient for more exploration convergence speed. The experimental results on five standard test functions show that the improved FW A has better optimization performance than FW A and sparrow search algorithm (SSA) in terms of search accuracy and convergence speed. The optimal solution is obtained on two test functions.