A Hybrid Backtracking Search Optimization Algorithm with Differential Evolution

Abstract EN

The backtracking search optimization algorithm (BSA) is a new nature-inspired method which possesses a memory to take advantage of experiences gained from previous generation to guide the population to the global optimum.

BSA is capable of solving multimodal problems, but it slowly converges and poorly exploits solution.

The differential evolution (DE) algorithm is a robust evolutionary algorithm and has a fast convergence speed in the case of exploitive mutation strategies that utilize the information of the best solution found so far.

In this paper, we propose a hybrid backtracking search optimization algorithm with differential evolution, called HBD.

In HBD, DE with exploitive strategy is used to accelerate the convergence by optimizing one worse individual according to its probability at each iteration process.

A suit of 28 benchmark functions are employed to verify the performance of HBD, and the results show the improvement in effectiveness and efficiency of hybridization of BSA and DE.