Advertisement

Bat Algorithm with Adaptive Speed

  • Siqing YouEmail author
  • Dongjie Zhao
  • Hongjie Liu
  • Fei Xue
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 516)

Abstract

As a famous heuristic algorithm, bat algorithm (BA) simulates the behavior of bat echolocation, which has simple model, fast convergence and distributed characteristics. But it also has some defects like slow convergence and low optimizing accuracy. Facing the shortages above, an optimization bat algorithm based on adaptive speed strategy is proposed. This improved algorithm can simulate the bat in the process of search based on adaptive value size and adaptive speed adjustment. His approach can improve the optimization efficiency and accuracy. Experimental results on CEC2013 test benchmarks show that our proposal has better global searchability and a faster convergence speed, and can effectively overcome the problem convergence.

Keywords

Heuristic optimization algorithm Bat algorithm Convergence Adaptive speed 

Notes

Acknowledgments

This work was supported by Beijing Key Laboratory (No: BZ0211) and Beijing Intelligent Logistics System Collaborative Innovation Center.

References

  1. 1.
    Eberhart R, Kennedy J. A new optimizer using particle swarm theory. In: New York: IEEE; 1995. p. 39–43.Google Scholar
  2. 2.
    Holland JH. Genetic algorithms and the optimal allocation of trials. SIAM J Comput. 1973;2(2):88–105.MathSciNetCrossRefGoogle Scholar
  3. 3.
    Yang X. Nature-inspired metaheuristic algorithms. Luniver press, 2010.Google Scholar
  4. 4.
    Wolpert DH, Macready WG. No free lunch theorems for optimization. IEEE Trans Evol Comput. 1997;1(1):67–82.CrossRefGoogle Scholar
  5. 5.
    Ho Y, Pepyne DL. Simple explanation of the no-free-lunch theorem and its implications. J Optim Theory Appl. 2002;115(3):549–70.MathSciNetCrossRefGoogle Scholar
  6. 6.
    Dorigo M, Birattari M, Stutzle T. Ant colony optimization. IEEE Comput Intell Mag. 2006;1(4):28–39.CrossRefGoogle Scholar
  7. 7.
    Karaboga D, Akay B. A survey: Algorithms simulating bee swarm intelligence. Artif Intell Rev. 2009;31(1–4):61–85.CrossRefGoogle Scholar
  8. 8.
    Whitley D. A genetic algorithm tutorial. Stat Comput. 1994;4(2):65–85.CrossRefGoogle Scholar
  9. 9.
    Yang X, Hossein Gandomi A. Bat algorithm: A novel approach for global engineering optimization. Eng Comput. 2012;29(5):464–83.CrossRefGoogle Scholar
  10. 10.
    Yang X. A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO 2010), 2010. p. 65–74.CrossRefGoogle Scholar
  11. 11.
    Liang JJ, Qu BY, Suganthan PN, et al. Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Nanyang Technological University, Singapore, Technical Report. 2013, 201212: 3–18.Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  • Siqing You
    • 1
    Email author
  • Dongjie Zhao
    • 1
  • Hongjie Liu
    • 2
  • Fei Xue
    • 1
  1. 1.School of InformationBeijing Wuzi UniversityBeijingChina
  2. 2.Beijing Advanced Innovation Center for Future Internet TechnologyBeijingChina

Personalised recommendations