Chaotic Fruit Fly Algorithm for Solving Engineering Design Problems

The aim of this article is to present a chaotic fruit fly algorithm (CFFA) as an optimization approach for solving engineering design problems (EDPs). In CFFA, the fruit fly algorithm (FFA), which is recognized for its durability and efficiency in addressing optimization problems, was paired with the chaotic local search (CLS) method, which allows for local exploitation. CFFA will be set up to work in two phases: in the first, FFA will be used to discover an approximate solution, and in the second, chaotic local search (CLS) will be used to locate the optimal solution. As a result, CFFA can address difficulties associated with the basic FFA such as falling into local optima, an imbalance between exploitation and exploration, and a lack of optimum solution acquisition (i.e., overcoming the drawback of premature convergence and increasing the local exploitation capability). The chaotic logistic map is employed in the CLS because it has been demonstrated to be effective in improving the quality of solutions and giving the best performance by many studies. The proposed algorithm is tested by the set of CEC’2005 special sessions on real parameter optimization and many EDPs from the most recent test suite CEC’2020. The results have demonstrated the superiority of the proposed approach to finding the global optimal solution. Finally, CFFA′s results were compared to those of earlier research, and statistical analysis using Friedman and Wilcoxon's tests revealed its superiority and capacity to tackle this type of problem.