Adaptive Fireworks Algorithm Based on Two-Master Sub-population and New Selection Strategy

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Adaptive Fireworks Algorithm (AFWA) is an effective algorithm for solving optimization problems. However, AFWA is easy to fall into local optimal solutions prematurely and it also provides a slow convergence rate. In order to improve these problems, the purpose of this paper is to apply two-master sub-population (TMS) and new selection strategy to AFWA with the goal of further boosting performance and achieving global optimization. Our simulation compares the proposed algorithm (TMSFWA) with the FWA-Based algorithms and other swarm intelligence algorithms. The results show that the proposed algorithm achieves better overall performance on the standard test functions.

Cite

CITATION STYLE

APA

Li, X., Han, S., Zhao, L., & Gong, C. (2017). Adaptive Fireworks Algorithm Based on Two-Master Sub-population and New Selection Strategy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10637 LNCS, pp. 70–79). Springer Verlag. https://doi.org/10.1007/978-3-319-70093-9_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free