A Novel Hybrid Self-Adaptive Bat Algorithm

Abstract EN

Nature-inspired algorithms attract many researchers worldwide for solving the hardest optimization problems.

One of the newest members of this extensive family is the bat algorithm.

To date, many variants of this algorithmhave emerged for solving continuous as well as combinatorial problems.

One of the more promising variants, a self-adaptive bat algorithm, has recently been proposed that enables a self-adaptation of its control parameters.

In this paper, we have hybridized this algorithm using different DE strategies and applied these as a local search heuristics for improving the current best solution directing the swarm of a solution towards the better regions within a search space.

The results of exhaustive experiments were promising and have encouraged us to invest more efforts into developing in this direction.