An enhanced honey badger algorithm based on Lévy flight and refraction opposition-based learning for engineering design problems

What is it about?

Honey badger algorithm (HBA) is a recently developed meta-heuristic algorithm, which mainly simulates the dynamic search behavior of honey badger in wild nature. Similar to other basic algorithms, HBA may suffer from the weakness of poor convergence accuracy, inadequate balance between exploration and exploitation, and ease of getting trapped into the local optima. To address these drawbacks, this paper proposes an enhanced honey badger algorithm (EHBA) to improve the search quality of the basic method for function optimization and engineering design problems.

Featured Image

Photo by Vincent van Zalinge on Unsplash

Photo by Vincent van Zalinge on Unsplash

Why is it important?

We try to improve the optimization performance of the basic Honey Badger Algorithm (HBA) from three aspects. to improve the search quality of the basic method from three aspects. First, we introduce the highly disruptive polynomial mutation to initialize the population. This is considered from increasing the population diversity. Second, Lévy flight is integrated into the position update formula to boost search efficiency and balance exploration and exploitation capabilities of the algorithm. Furthermore, the refraction opposition-based learning is applied to the current global optimum of the swarm to help the population jump out of the local optima. Numerical experiments demonstrate that the proposed method is effective and promising.

Perspectives