Ensemble bat algorithm based on Hyper heuristic approach for solving unconstrained optimization problems

Main Article Content

Wakas S. Khalaf

Abstract

Abstract  Maintaining convergence and diversification in solving optimization is one of the most important challenges facing metaheuristic algorithms in general and the bat algorithm in particular. Many researchers have suggested some improvements to preserve the ability of the algorithm to find good solutions in a timely manner and also to move away as much as possible from landing on the local optimization zone. In this paper, a hyper-heuristic method was proposed to incorporate the behavior of three optimized algorithms from the bat algorithm. The method is based on the distribution of a specific implementation probability for each used algorithm and then updating this probability iteratively according to the results of each algorithm, and then we use random selection to determine the algorithm used in the current iteration. Some nonlinear models proposed in CEC2005 used to compare the efficiency of the proposed algorithm and compare its results with some state-of-the-art algorithms.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
Khalaf, W. S. . . (2021). Ensemble bat algorithm based on Hyper heuristic approach for solving unconstrained optimization problems. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(10), 5466–5478. https://doi.org/10.17762/turcomat.v12i10.5352
Section
Research Articles