Analysis and Improvement of Fireworks Algorithm
AbstractThe Fireworks Algorithm is a recently developed swarm intelligence algorithm to simulate the explosion process of fireworks. Based on the analysis of each operator of Fireworks Algorithm (FWA), this paper improves the FWA and proves that the improved algorithm converges to the global optimal solution with probability 1. The proposed algorithm improves the goal of further boosting performance and achieving global optimization where mainly include the following strategies. Firstly using the opposition-based learning initialization population. Secondly a new explosion amplitude mechanism for the optimal firework is proposed. In addition, the adaptive t-distribution mutation for non-optimal individuals and elite opposition-based learning for the optimal individual are used. Finally, a new selection strategy, namely Disruptive Selection, is proposed to reduce the running time of the algorithm compared with FWA. In our simulation, we apply the CEC2013 standard functions and compare the proposed algorithm (IFWA) with SPSO2011, FWA, EFWA and dynFWA. The results show that the proposed algorithm has better overall performance on the test functions. View Full-Text
Share & Cite This Article
Li, X.-G.; Han, S.-F.; Gong, C.-Q. Analysis and Improvement of Fireworks Algorithm. Algorithms 2017, 10, 26.
Li X-G, Han S-F, Gong C-Q. Analysis and Improvement of Fireworks Algorithm. Algorithms. 2017; 10(1):26.Chicago/Turabian Style
Li, Xi-Guang; Han, Shou-Fei; Gong, Chang-Qing. 2017. "Analysis and Improvement of Fireworks Algorithm." Algorithms 10, no. 1: 26.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.