Bat algorithm with individual local search

Abstract

Bat algorithm (BA) is a well-known heuristic algorithm, and has been applied to many practical problems. However, the local search method employed in BA has the shortcoming of premature convergence, and does not perform well in early search stage. To avoid this issue, this paper proposes a new update method for local search. To verify the proposed method, this paper employs CEC2013 test suit to test it with PSO and standard BA as comparison algorithms. Experimental results demonstrate that the proposed method obviously outperforms other algorithms and exhibits better performance.