Research Area:  Metaheuristic Computing

Abstract:

Population-based algorithms have been used in many real-world problems. Bat algorithm (BA) is one of the states of the art of these approaches. Because of the super bat, on the one hand, BA can converge quickly; on the other hand, it is easy to fall into local optimum. Therefore, for typical BA algorithms, the ability of exploration and exploitation is not strong enough and it is hard to find a precise result. In this paper, we propose a novel bat algorithm based on cross boundary learning (CBL) and uniform explosion strategy (UES), namely BABLUE in short, to avoid the above contradiction and achieve both fast convergence and high quality. Different from previous opposition-based learning, the proposed CBL can expand the search area of population and then maintain the ability of global exploration in the process of fast convergence. In order to enhance the ability of local exploitation of the proposed algorithm, we propose UES, which can achieve almost the same search precise as that of firework explosion algorithm but consume less computation resource. BABLUE is tested with numerous experiments on unimodal, multimodal, one-dimensional, high-dimensional and discrete problems, and then compared with other typical intelligent optimization algorithms. The results show that the proposed algorithm outperforms other algorithms.

Keywords:  
real-world problems
bat algorithm
exploration
exploitation
cross boundary learning
uniform explosion strategy
population

Author(s) Name:  Jia-shi Yong, Fa-zhi He, Hao-ran Li & Wei-qing Zhou

Publisher name:  Springer

DOI:  10.1007/s11766-019-3714-1

Volume Information:  34, pages 480–502

Paper Link:   https://link.springer.com/article/10.1007/s11766-019-3714-1