The stability analysis of Bat Algorithm

Abstract

The equations describing the position and movement of the new individuals in Bath Algorithm have the form of difference equations. The analysis of the behavior of solutions of this equation and in particular its stability is possible, after omitting of randomness in parameters and treatment of the algorithm as stationary. The simplify analysis of the choice of parameters of the bat algorithm based on the linear stability and behavior of the algorithm is presented in the paper. The study indicates the recommended areas of the location of the parameters, and it shows how the different parameters affect the behavior of the algorithm. A simple tool to speed up the tuning of the algorithm was obtained.