Loop bat family algorithm (Loop BFA) for constrained optimization

Abstract

The standard Bat algorithm (BA) is extended by introducing a bat family for the purpose of continuous repetition of the procedure for searching for an optimal solution. The standard BA is modified by including the loop search in the zone of solutions. For each bat, in each family, fine search according to the step of Lévy-flight is used for looking for an improved solution until the given constraints are satisfied. Such solutions are compared for each bat family and the best one is selected. The loop bat family algorithm (Loop BFA) is tested on five engineering examples known in the literature. The correctness and efficiency of the proposed algorithm are verified by good results in these examples.