Abstract
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.
Similar content being viewed by others
References
Bratton D, Kennedy J (2007) Defining a standard for particle swarm optimization. In: Proceedings of IEEE swarm intelligence symposium, pp 120–127
Brest J, Greiner S, Boskovic B et al (2006) Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans Evol Comput 10(6):646–657
Chen D, Zou F, Lu R et al (2018a) Backtracking search optimization algorithm based on knowledge learning. Inf Sci 473:202–226
Chen S, Liu Y, Wei L et al (2018b) PS-FW: a hybrid algorithm based on particle swarm and fireworks for global optimization. Comput Intell Neurosci 2018:1–27
Civicioglu P (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144
Daniel B, Kennedy J (2007) Defining a standard for particle swarm optimization. In: Proceeding of the 2007 IEEE swarm intelligence symposium (SIS2007)
Gao H, Diao M (2011) Cultural firework algorithm and its application for digital filters design. Int J Modell Identif Control 14(4):324–331
Gholizadeh S, Milany A (2018) An improved fireworks algorithm for discrete sizing optimization of steel skeletal structures. Eng Optim 2018:1–21
Ke D, Zheng S, Ying T (2013) A GPU-based parallel fireworks algorithm for optimization. In: Conference on genetic & evolutionary computation, pp 1–8
Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of 1995 IEEE international conference neural networks, vol 4, pp 1942–1948
Li J, Zheng S, Ying T (2014) Adaptive fireworks algorithm. In: 2014 IEEE congress on evolutionary computation (CEC). IEEE, pp 3214–3221
Li J, Zheng S, Tan Y (2017) The effect of information utilization: introducing a novel guiding spark in the fireworks algorithm. IEEE Trans Evol Comput 21(1):135–166
Li J, Tian Q, Zhang G et al (2018) Task scheduling algorithm based on fireworks algorithm. Eurasip J Wirel Commun Netw 1:256
Liang JJ, Qin AK, Suganthan PN et al (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evol Comput 10(3):281–295
Liang JJ, Qu BY, Suganthan PN (2013) Problem definitions and evaluation criteria for the cec 2014 special session and competition on single objective real-parameter numerical optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore
Liu J, Zheng S, Ying T (2013) The improvement on controlling exploration and exploitation of firework algorithm. In: Advances in swarm intelligence: 4th international conference, ICSI 2013, Harbin, China, Proceedings, Part I, pp 11–23
Ludwig SA, Dawar D (2015) Parallelization of enhanced firework algorithm using map-reduce. Int J Swarm Intell Res 6(2):32–51
Mendes R, Kennedy J, Neves J (2004) The fully informed particle swarm: simpler, maybe better. IEEE Trans Evol Comput 8(3):204–210
Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46–61
Pei Y, Zheng S, Tan Y, Takagi H (2012) An empirical study on influence of approximation approaches on enhancing fireworks algorithm. In: 2012 IEEE international conference on systems, man, and cybernetics, Seoul, Korea, pp 1322–1327
Pholdee N, Bureerat S (2014) Comparative performance of meta-heuristic algorithms for mass minimisation of trusses with dynamic constraints. Adv Eng Softw 75(3):1–13
Pushpa F, Chand BJ (2018) Fireworks-inspired biogeography-based optimization. Soft Comput. https://doi.org/10.1007/s00500-018-3351-2
Reddy KS, Panwarand LK, Kumar R et al (2016) Distributed resource scheduling in smart grid with electric vehicle deployment using fireworks algorithm. J Mod Power Syst Clean Energy 4(2):188–199
Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359
Suganthan PN, Hansen N, Liang JJ, et al. (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Natural Computing, pp 341–357
Tan Y, Xiao ZM (2007) Clonal particle swarm optimization and its applications. In: Proceedings of IEEE congress on evolutionary computation, pp 2303–2309
Tan Y, Zhu YC (2010) Fireworks algorithm for optimization. In: International conference on advances in swarm intelligence. Berlin Heidelberg, pp 355–364
Tu Z, Yong L (2004) A robust stochastic genetic algorithm (StGA) for global numerical optimization. IEEE Trans Evol Comput 8(5):456–470
Tuba E, Tuba M, Beko M.(2016) Node localization in ad hoc wireless sensor networks using fireworks algorithm. In: 2016 5th international conference on multimedia computing and systems (ICMCS)
Xin Y, Yong L, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(2):82–102
Xu X, Rong H, Trovati M et al (2018) CS-PSO: chaotic particle swarm optimization algorithm for solving combinatorial optimization problems. Soft Comput 22(3):783–795
Yang XS (2010) A new metaheuristic bat-inspired algorithm. Comput Knowl Technol 284:65–74
Yang W, Ke L (2018) An improved fireworks algorithm for the capacitated vehicle routing problem. Front Comput Sci 13(3):1–13
Ye S, Ma H, Xu S, Yang W, Fei M (2016) An effective fireworks algorithm for warehouse-scheduling problem. Trans Inst Meas Control 39(1):75–85
Yilmaz S, Kucuksille EU (2014) A new modification approach on bat algorithm for solving optimization problems. Appl Soft Comput 28(5):259–275
Yu C, Tan Y (2015) Fireworks algorithm with covariance mutation. In: 2015 IEEE congress on evolutionary computation, Sendai, Japan, pp 1–8
Zhang B, Zhang MX, Zheng YJ (2014) A hybrid biogeography-based optimization and fireworks algorithm. In: 2014 IEEE congress on evolutionary computation (CEC), IEEE, pp 3200–3206
Zhao H, Zhang C, Ning J (2020) A core firework updating information guided dynamic fireworks algorithm for global optimization. Soft Comput 24:1185–1211
Zheng S, Janecek A, Ying T (2013a) Enhanced fireworks algorithm. In: IEEE congress on evolutionary computation (CEC), pp 2069–2077
Zheng YJ, Song Q, Chen SY (2013b) Multiobjective fireworks optimization for variable-rate fertilization in oil crop production. Appl Soft Comput 13(11):4253–4263
Zheng S, Janecek A, Li J, et al. (2014) Dynamic search in fireworks algorithm. In: 2014 IEEE congress on evolutionary computation (CEC). IEEE, pp 3222–3229
Zheng YJ, Xu XL, Ling HF et al (2015) A hybrid fireworks optimization method with differential evolution operators. Neurocomputing 148(2015):75–82
Acknowledgements
This work was supported in part by the National Science Foundations of China (Grant Nos. 61976101, 61572224, 61304082 and 41475017) and the National Science Found for Distinguished Young Schools (Grant No. 61425009). This work is also partially supported by Anhui Provincial Natural Science Foundation (Grant No. 1708085MF140) and the Natural Science Foundation in colleges and universities of Anhui Province (Grant No. KJ2019B16).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the author.
Additional information
Communicated by V. Loia.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
In Table 10, better mean error achieved in 21 functions, better standard deviation obtained in 12 functions, better median achieved in 15 functions, better best error achieved in 19 functions, better worst error achieved in 19 functions, out of total 30 CEC 2014 functions by FBBO. However, better mean error achieved in 14 functions, better standard deviation obtained in 18 functions, better median achieved in 20 functions, better best error achieved in 17 functions, better worst error achieved in 15 functions, out of total 30 CEC 2014 functions by DFWPSO. The two algorithms have their own advantages in CEC2014 test suites.
Rights and permissions
About this article
Cite this article
Zhu, F., Chen, D. & Zou, F. A novel hybrid dynamic fireworks algorithm with particle swarm optimization. Soft Comput 25, 2371–2398 (2021). https://doi.org/10.1007/s00500-020-05308-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-020-05308-6