Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search

Abstract EN

Binary bat algorithm (BBA) is a binary version of the bat algorithm (BA).

It has been proven that BBA is competitive compared to other binary heuristic algorithms.

Since the update processes of velocity in the algorithm are consistent with BA, in some cases, this algorithm also faces the premature convergence problem.

This paper proposes an improved binary bat algorithm (IBBA) to solve this problem.

To evaluate the performance of IBBA, standard benchmark functions and zero-one knapsack problems have been employed.

The numeric results obtained by benchmark functions experiment prove that the proposed approach greatly outperforms the original BBA and binary particle swarm optimization (BPSO).

Compared with several other heuristic algorithms on zero-one knapsack problems, it also verifies that the proposed algorithm is more able to avoid local minima.