Multi-Strategy Improved Flamingo Search Algorithm for Global Optimization

To overcome the limitations of the Flamingo Search Algorithm (FSA), such as a tendency to converge on local optima and improve solution accuracy, we present an improved algorithm known as the Multi-Strategy Improved Flamingo Search Algorithm (IFSA). The IFSA utilizes a cube chaotic mapping strategy to generate initial populations, which enhances the quality of the initial solution set. Moreover, the information feedback model strategy is improved to dynamically adjust the model based on the current fitness value, which enhances the information exchange between populations and the search capability of the algorithm itself. In addition, we introduce the Random Opposition Learning and Elite Position Greedy Selection strategies to constantly retain superior individuals while also reducing the probability of the algorithm falling into a local optimum, thereby further enhancing the convergence of the algorithm. We evaluate the performance of the IFSA using 23 benchmark functions and verify its optimization using the Wilcoxon rank-sum test. The compared experiment results indicate that the proposed IFSA can obtain higher convergence accuracy and better exploration abilities. It also provides a new optimization algorithm for solving complex optimization problems.