Earticle

초록

영어

Bat algorithm is an optimization method inspired by the echo-location bats to search in nature, hunt prey behavior, combining multi-agent system and evolution mechanism. To improve the search results of BA algorithm, this paper proposes a gauss perturbation bats optimization algorithm based on simulated annealing (SAGBA). Firstly, the bionic principle, optimization mechanism and characteristics of the bat algorithm are analyzed and the algorithm optimization process are defined; Then the idea of the simulated annealing is put into bat optimization algorithm, and Gaussian disturbance is carried out to some individuals using the bat algorithm and strengthen the ability of the bat algorithm jumping out of local optimal solution. Finally, conduct simulations are respectively compared in 20 typical benchmark test functions among bat optimization algorithm, simulates annealing particle swarm algorithm and SAGBA algorithm. The results show that SAGBA algorithm not only increases the global convergence, but convergence speed and accuracy are better than other two algorithms.

목차

Abstract
 1. Introduction
 2. Proposed Algorithm
  A. Biological Mechanism and Mathematical Simulation of the Algorithm
  B. Simulated Annealing
  C. The Bat Optimization Algorithm Based on Simulated Annealing
 3. Simulation Experiment
  A. Experiment Design
  B. Analysis of Experimental Results
 4. Conclusion
 Refernces

키워드

저자

• Zhao Guodong [ School of Mathematics and Computer Science, Ningxia University, Yinchuan, China ]
• Zhou Ying [ School of Science and Engineering, Tianjin Open University, China ]
• Song Liya [ Department of physics and Electrical Engineering, Ningxia University, Yinchuan, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Hybrid Information Technology

• 간기

  격월간

• pISSN

  1738-9968

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605