Advertisement

Neural Computing and Applications

, Volume 31, Issue 1, pp 79–99 | Cite as

A best firework updating information guided adaptive fireworks algorithm

  • Haitong Zhao
  • Changsheng ZhangEmail author
  • Jiaxu Ning
Original Article
  • 161 Downloads

Abstract

As a new variant of swarm intelligence algorithm, fireworks algorithm (FWA) has significant performance on solving single objective problems, and has been applied broadly on a number of fields. To further improve its performance, a best firework updating information guided adaptive fireworks algorithm (PgAFWA) is proposed, in which the evolving process is guided by the direction from previous best firework to the current best firework from two aspects: amplifying the explosion amplitude on the direction that the best firework is updated, and making more sparks which are generated by the best firework distributed on this direction to further enhance the exploring ability on it. Numerical experiment on CEC2015 test suite was implemented to verify performance of the proposed algorithm. The experiment results indicated that the PgAFWA outperformed the compared algorithms in terms of both convergence speed and solving quality.

Keywords

Fireworks algorithm Best firework Adaptive fireworks algorithm Updating direction Explosion range 

Notes

Acknowledgements

This work was supported by the National Natural Science Foundation Program of China (61572116, 61572117), and the Special Fund for Fundamental Research of Central Universities of Northeastern University (N150408001, N150404009, N161606003).

Compliance with ethical standards

Conflict of interest

We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work, there is no professional or other personal interest of any nature or kind in any product, service and/or comspany that could be construed as influencing the position presented in, or the review of, the manuscript entitled, “A Best Firework Updating Information Guided Adaptive Fireworks Algorithm”.

References

  1. 1.
    Beni G, Wang J. Swarm Intelligence in Cellular Robotic Systems[M]// Robots and Biological Systems: Towards a New Bionics. 1993:703–712.Google Scholar
  2. 2.
    Kennedy J, Eberhart R (1995) Particle swarm optimization[C]// IEEE International Conference on Neural Networks, 1995. Proceedings. IEEE, 4:1942–1948Google Scholar
  3. 3.
    Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53–66CrossRefGoogle Scholar
  4. 4.
    Karaboga D (2010) Artificial bee colony algorithm. Scholarpedia 5(3):24–32CrossRefGoogle Scholar
  5. 5.
    Tan Y, Zhu Y (2010) Fireworks algorithm for optimization[C]// International conference on advances in swarm intelligence. Springer-Verlag:355–364Google Scholar
  6. 6.
    Li J, Zheng S, Tan Y (2016) The effect of information utilization: 1105 introducing a novel guiding spark in the fireworks algorithm. IEEE 1106 Trans Evol Comput:1–1Google Scholar
  7. 7.
    Zheng S, Janecek A, Tan Y. Enhanced Fireworks Algorithm[C]// Evolutionary Computation. 2013:2069–2077.Google Scholar
  8. 8.
    Zhang B, Zhang MX, Zheng YJ (2014) A hybrid biogeography- 1108 based optimization and fireworks algorithm[C]// evolutionary com- 1109 putation. IEEE:3200–3206Google Scholar
  9. 9.
    Yu C, Li J, Tan Y (2014) Improve enhanced fireworks algorithm with differential mutation[C]// IEEE International Conference on Systems. Man and Cybernetics, IEEEGoogle Scholar
  10. 10.
    Gao H, Diao M (2011) Cultural firework algorithm and its application for digital filters design. International Journal of Modelling Identification & Control 14(4):324–331CrossRefGoogle Scholar
  11. 11.
    Zheng YJ, Xu XL, Ling HF et al (2015) A hybrid fireworks optimization method with differential evolution operators. Neurocomputing 148(148):75–82CrossRefGoogle Scholar
  12. 12.
    Yu C, Tan Y. Fireworks algorithm with covariance mutation[C]// evolutionary computation. IEEE, 2015.Google Scholar
  13. 13.
    Yu C, Kelley LC, Tan Y, Dynamic search fireworks algorithm with covariance mutation for solving the CEC (2015) Learning based competition problems[C]//2015 I.E. congress on evolutionary computation (CEC). IEEE 2015:1106–1112Google Scholar
  14. 14.
    Li J, Tan Y. Orienting mutation based fireworks algorithm[C]// Evolutionary Computation. IEEE, 2015.Google Scholar
  15. 15.
    Zheng S, Li J, Janecek A et al (2015) A cooperative framework for 1072 fireworks algorithm[J]. IEEE/ACMTransactions on Computational 1073 Biology & Bioinformatics:1–1Google Scholar
  16. 16.
    Zhang B, Zheng Y-J et al (2015) Fireworks algorithm with enhanced fireworks interaction. IEEE/ACM Transactions on Computational Biology & Bioinformatics:1–1Google Scholar
  17. 17.
    Zheng S, Janecek A, Li J et al (2014) Dynamic search in fireworks algorithm[C]// evolutionary computation. IEEE:3222–3229Google Scholar
  18. 18.
    Li J, Zheng S, Tan Y (2014) Adaptive fireworks algorithm[C]// evolutionary computation. IEEE:3214–3221Google Scholar
  19. 19.
    Si T, Ghosh R (2015) Explosion sparks generation using adaptive transfer function in firework algorithm[C]// IEEE third International conference on signal processing. Communications and NETWORKING:305–314Google Scholar
  20. 20.
    Chen J, Yang Q, Ni J et al (2015) An improved fireworks algorithm with landscape information for balancing exploration and exploitation[C]//2015 I.E. congress on evolutionary computation (CEC). IEEE:1272–1279Google Scholar
  21. 21.
    Zheng S, Yu C, Li J, et al. Exponentially decreased dimension number strategy based dynamic search fireworks algorithm for solving CEC2015 competition problems[C]// evolutionary computation. IEEE, 2015.Google Scholar
  22. 22.
    Ding K, Zheng S, Tan Y. A gpu-based parallel fireworks algorithm for optimization[C]//Proceedings of the 15th annual conference on Genetic and evolutionary computation. ACM, 2013: 9–16.Google Scholar
  23. 23.
    Liang J J, Qu B Y, Suganthan P N, et al. Problem definitions and 1099 evaluation criteria for the CEC 2015 competition on learning-based 1100 real-parameter single objective optimization[J]. Technical 1101 Report201411A, Computational Intelligence Laboratory, 1102 Zhengzhou University, Zhengzhou China and Technical Report, 1103 Nanyang Technological University, Singapore, 2014.Google Scholar
  24. 24.
    Nowak K, Märtens M, Izzo D (2014) Empirical performance of the approximation of the least hypervolume contributor[M]//parallel problem solving from nature–PPSN XIII. Springer International Publishing:662–671Google Scholar

Copyright information

© The Natural Computing Applications Forum 2017

Authors and Affiliations

  1. 1.College of Computer Science & EngineeringNortheastern UniversityShenyangPeople’s Republic of China

Personalised recommendations