Search

Bald Eagle Search optimization (BES) is introduced recently, which mimics the bald eagles' hunting and food searching behaviour. The capability of a BES algorithm is enhanced in this paper by avoiding local optima stagnation and premature convergence problems. The BES algorithm is modified to enhance the performance of the algorithm and the modified algorithm is called the Self Adaptive Bald Eagle Search (SABES) algorithm. Dynamic‐opposite Learning (DOL) method is invoked in the initialization phase to increase the population diversity and convergence speed. To find better global solutions, the exploitation capability of the SBES algorithm is enhanced by considering the dynamic‐opposite solutions. In addition, the algorithmic parameter values of the BES algorithm have been determined using the linear and non‐linear time‐varying adaption strategy to create a balance between the search abilities which promotes the overall performance of the algorithm. The performance of the SABES algorithm is validated by comparing the results of 50 benchmark functions and CEC2017 functions with different erstwhile algorithms. The proposed algorithm achieves the best results in 80% of the benchmark functions, whereas the BES only gets the best results in 56% of functions. For the CEC2017, the SABES algorithm achieves optimal results for 20 functions which are highest in comparison to state‐of‐the‐art algorithms. The feasibility and effectiveness of the proposed algorithm are checked using the 15 CEC2020 competition real‐world single‐objective constrained optimization problems. The SABES achieves a 100% success rate and 100% feasibility rate in comparison to other well‐regarded algorithms. The statistical significance of the algorithm has been proved using Friedman's mean rank and Wilcoxon sign rank test. [ABSTRACT FROM AUTHOR]

This work proposed a new metaheuristic dubbed as Chaotic Lévy flight distribution (CLFD) algorithm, to address physical world engineering optimization problems that incorporate the chaotic maps in the elementary Lévy flight distribution (LFD). Hybridization aims to increase the LFD rate of convergence while also providing a problem‐free optimization approach. The proposed methodology is investigated for five case studies of constrained optimization issues followed by shape optimization of structural design. The outcomes from the CFLD algorithm are further contrasted with its fundamental version and other distinguished recently introduced algorithms. The computational analysis illustrates the dominance of CLFD over other considered optimizers. Moreover, the present investigation shows that CLFD is a robust technique that can efficiently find optimal mechanical design problems with a proper chaotic map selection. [ABSTRACT FROM AUTHOR]