CEC2005 Benchmark Research Articles

Secretary bird optimization algorithm based on quantum computing and multiple strategies improvement for KELM diabetes classification.

The classification of chronic diseases has long been a prominent research focus in the field of public health, with widespread application of machine learning algorithms. Diabetes is one of the chronic diseases with a high prevalence worldwide and is considered a disease in its own right. Given the widespread nature of this chronic condition, numerous researchers are striving to develop robust machine learning algorithms for accurate classification. This study introduces a revolutionary approach for accurately classifying diabetes, aiming to provide new methodologies. An improved Secretary Bird Optimization Algorithm (QHSBOA) is proposed in combination with Kernel Extreme Learning Machine (KELM) for a diabetes classification prediction model. First, the Secretary Bird Optimization Algorithm (SBOA) is enhanced by integrating a particle swarm optimization search mechanism, dynamic boundary adjustments based on optimal individuals, and quantum computing-based t-distribution variations. The performance of QHSBOA is validated using the CEC2017 benchmark suite. Subsequently, QHSBOA is used to optimize the kernel penalty parameter [Formula: see text] and bandwidth [Formula: see text] of the KELM. Comparative experiments with other classification models are conducted on diabetes datasets. The experimental results indicate that the QHSBOA-KELM classification model outperforms other comparative models in four evaluation metrics: accuracy (ACC), Matthews correlation coefficient (MCC), sensitivity, and specificity. This approach offers an effective method for the early diagnosis and prediction of diabetes.

Balanced dung beetle optimization algorithm based on parameter substitution and escape strategy

Dung Beetle algorithm is an intelligent optimization algorithm with advantages in exploitation ability. However, due to the high randomness of parameters, premature convergence and other reasons, there is an imbalance between exploration and exploitation ability, and it is easy to fall into the problem of local optimal solution. The purpose of this study is to improve the optimization performance of dung beetle algorithm and explore its engineering application value. A balanced dung beetle optimization algorithm was proposed, and parabolic adaptive parameter R was introduced to broaden the exploration range and slow down premature convergence. Gaussian distributed phase parameter β is introduced to reduce the randomness of parameters and stimulate the potential of algorithm exploitation. Levy flight escape strategy is introduced to balance the global exploration ability of the algorithm and fully explore the solution space. The effectiveness of the improved strategy is verified by comparing the CEC2017 benchmark function with the single strategy variant. The experimental results show that BDBO algorithm is superior to other algorithms in terms of convergence accuracy and generalization ability, and the accuracy improvement percentage is 35.29% compared with DBO algorithm. Wilcoxon rank sum test was used to evaluate the experimental results, which proved that the improvement strategy was statistically significant. Finally, the BDBO algorithm is applied to the tracking technology of the maximum power point of the photovoltaic system, and the experimental results show that the application effect of the BDBO algorithm is better and has more engineering application value.

Crisscross Moss Growth Optimization: An Enhanced Bio-Inspired Algorithm for Global Production and Optimization.

Global optimization problems, prevalent across scientific and engineering disciplines, necessitate efficient algorithms for navigating complex, high-dimensional search spaces. Drawing inspiration from the resilient and adaptive growth strategies of moss colonies, the moss growth optimization (MGO) algorithm presents a promising biomimetic approach to these challenges. However, the original MGO can experience premature convergence and limited exploration capabilities. This paper introduces an enhanced bio-inspired algorithm, termed crisscross moss growth optimization (CCMGO), which incorporates a crisscross (CC) strategy and a dynamic grouping parameter, further emulating the biological mechanisms of spore dispersal and resource allocation in moss. By mimicking the interwoven growth patterns of moss, the CC strategy facilitates improved information exchange among population members, thereby enhancing offspring diversity and accelerating convergence. The dynamic grouping parameter, analogous to the adaptive resource allocation strategies of moss in response to environmental changes, balances exploration and exploitation for a more efficient search. Key findings from rigorous experimental evaluations using the CEC2017 benchmark suite demonstrate that CCMGO consistently outperforms nine established metaheuristic algorithms across diverse benchmark functions. Furthermore, in a real-world application to a three-channel reservoir production optimization problem, CCMGO achieves a significantly higher net present value (NPV) compared to benchmark algorithms. This successful application highlights CCMGO's potential as a robust and adaptable tool for addressing complex, real-world optimization challenges, particularly those found in resource management and other nature-inspired domains.

QSHO: Quantum spotted hyena optimizer for global optimization

Spotted Hyena Optimizer (SHO) is a population-based metaheuristic algorithm inspired by the spotted hyenas’ social behavior, and it has been developed to solve global optimization problems. SHO has shown superior performance over its competitive metaheuristic algorithms in solving benchmark function optimization and engineering design problems. However, it suffers from getting stuck in local optima due to its lack of exploration while solving multi-modal optimization problems. This article proposes an improved SHO, quantum SHO (QSHO), inspired by quantum computing. The QSHO implements a quantum computing mechanism to promote its exploration ability. The novel method is tested on well-known IEEE CEC2013 and IEEE CEC2017 benchmark suits with 30 and 50 dimensions and four real-world engineering optimization problems. The results of QSHO are compared with that of Classical SHO, improved SHO (ISHO), Modified SHO (MSHO), Oppositional SHO with mutation operator (OBL-MO-SHO), SHO with space transformation search (STS-SHO), Quantum Salp Swarm Algorithm (QSSA), and Chimp Optimization Algorithm (ChOA). The results are analyzed using the Wilcoxon Signed Rank Test (WSRT) and Friedman Test. The empirical results show that QSHO statistically outperforms other compared algorithms for benchmark problem suits with 30 and 50 dimensions. According to Friedman Test statistics, the QSHO algorithm ranked first and second in solving CEC2013 30D and 50D, respectively, whereas it ranked first in both solving CEC2017 30D and 50D. In addition, we have assessed the QSHO in four real-world engineering optimization problems, and the QSHO statistically outperforms the competitive algorithms.

A multi-strategy enhanced reptile search algorithm for global optimization and engineering optimization design problems

The reptile search algorithm (RSA) is a well-known swarm-based metaheuristic algorithm inspired by the hunting behaviors of crocodiles. To overcome the problems of falling into local optima and premature convergence, this paper proposes a multi-strategy enhanced reptile search algorithm (MRSA), which integrates a novel dynamic evolutionary sense, prey approaching strategy and Cauchy mutation strategy. The prey approaching strategy comes from the secretary bird optimization algorithm and is applied to strengthen the exploration capability of RSA. A comparative performance analysis is conducted using the CEC2005, CEC2017 and CEC2022 benchmark functions. And fifteen algorithms are employed for the performance comparison. The results of numerical, convergence curves, boxplots, Wilcoxon rank-sum test and Friedman ranking confirm the efficacy and stability of proposed MRSA, indicating its superior performance compared to other algorithms. Moreover, seven practical engineering design tasks are used to test the performance of MRSA in real-world optimization problems. The results also show that MRSA can efficiently obtain better optimal solution compared to existing methods.

Comparative analysis of accuracy and computational complexity across 21 swarm intelligence algorithms

Nonlinear, complex optimization problems are prevalent in many scientific and engineering fields. Traditional algorithms often struggle with these problems due to their high dimensionality and intricate nature, making them time-consuming. Many researchers have proposed new metaheuristic algorithms inspired by biological behaviors in nature, which comparatively show higher performance and accuracy than traditional optimization algorithms. Nature-inspired algorithms, particularly those based on swarm intelligence, offer adaptable and efficient solutions to these challenges. In recent years, swarm intelligence algorithms have made significant advancements. Classical and CEC benchmark suits are immersively useful for studying the performance of optimization algorithms. According to our literature survey, we identified that many algorithms were evaluated based on accuracy. Currently, swarm intelligence algorithms are used in many applications, and efficiency and computational complexity need to be evaluated. A broad-level study of the computational complexity and accuracy of popular swarm intelligence algorithms has not been done recently. Therefore this study we comprehensively evaluate and compare 21 bio-inspired swarm intelligence algorithms on eight non-separable unimodal, eight separable unimodal, five non-separable multimodal, seven separable multimodal functions, and two CEC 2018 many objective functions. We study the structure and mathematical model of the selected algorithms. Then we categorized selected algorithms into six different behavioral groups. We calculated the root mean square error between expected and actual values. Then we performed an RMSE cross-validation statistical test to understand how accurately an algorithm resolves an average problem. We found that Artificial Lizard Search Optimization (ALSO) is the most prominent algorithm in accuracy and efficiency. Besides that, Cat Swarm Optimization (CSO), Squirrel Search Algorithm (SSA), and Chimp Optimization Algorithm (CHOA-B) are also considered more universal algorithms. The Squirrel Search Algorithm (SSA) is ALSO’s second-best algorithm in time complexity. Wasp Swarm Algorithm (WSO), and Bat-Inspired Algorithm (BA) presented the lowest time complexity. Finally, several important issues and research directions are discussed.

Automated Design of Collaboration-Based Hybrid Metaheuristics.

Hybridization plays a prominent role in bolstering the performance of optimization algorithms (OAs), yet designing efficient hybrid OAs tailored to intricate optimization problems persists as a formidable task. This article introduces a novel top-down methodology for the automated design of hybrid OAs, treating algorithm design as a meta-optimization problem. A general design template for collaboration-based hybrid OAs is developed, integrating a multitude of hybridization strategies for the first time. Besides, a mathematical model is built to formulate the meta-optimization problem of algorithm design. To address the meta-optimization challenge, an improved multifactorial evolutionary algorithm is proposed to automatically design efficient hybrid metaheuristics in a multitasking environment for the given instances with diverse features. To verify the effectiveness of the proposed design methodology, it is applied to the CEC2017 benchmark functions and the binary knapsack problem. Numerical results have demonstrated the feasibility and effectiveness of the proposed methodology for both continuous and combinatorial optimization benchmarks.

A Novel Adaptive Sand Cat Swarm Optimization Algorithm for Feature Selection and Global Optimization.

Feature selection (FS) constitutes a critical stage within the realms of machine learning and data mining, with the objective of eliminating irrelevant features while guaranteeing model accuracy. Nevertheless, in datasets featuring a multitude of features, choosing the optimal feature poses a significant challenge. This study presents an enhanced Sand Cat Swarm Optimization algorithm (MSCSO) to improve the feature selection process, augmenting the algorithm's global search capacity and convergence rate via multiple innovative strategies. Specifically, this study devised logistic chaotic mapping and lens imaging reverse learning approaches for population initialization to enhance population diversity; balanced global exploration and local development capabilities through nonlinear parameter processing; and introduced a Weibull flight strategy and triangular parade strategy to optimize individual position updates. Additionally, the Gaussian-Cauchy mutation strategy was employed to improve the algorithm's ability to overcome local optima. The experimental results demonstrate that MSCSO performs well on 65.2% of the test functions in the CEC2005 benchmark test; on the 15 datasets of UCI, MSCSO achieved the best average fitness in 93.3% of the datasets and achieved the fewest feature selections in 86.7% of the datasets while attaining the best average accuracy across 100% of the datasets, significantly outperforming other comparative algorithms.

Frigatebird optimizer: a novel metaheuristic algorithm

Abstract This paper proposes a new swarm intelligence optimization algorithm - the Frigate Bird Optimizer (FBO). The algorithm is inspired by the unique flight and foraging behaviors of frigatebirds. Its optimization process is divided into two stages: The first stage simulates frigatebirds harassing other seabirds to snatch food, and the search direction and radius of individuals have randomness and uncertainty, which is conducive to global exploration; The second stage simulates frigatebirds observing large fish driving small fish to leap out of the water and preying on them, and individuals tend to gather in the optimal search direction. By simulating the behaviors of frigatebirds under different survival strategies, the algorithm achieves extensive global search in the first stage and fine-tuned local optimization by learning information in the second stage. To evaluate its performance, 46 functions in the CEC2014 and CEC2017 benchmark test sets are selected as objective functions and compared with 9 state-of-the-art meta-heuristic algorithms. The results show that the FBO algorithm has higher performance, excellent iterative optimization ability and strong robustness, and can be applied to different optimization domains.

Machine fault detection model based on MWOA-BiLSTM algorithm.

This paper proposes the Modulated Whale Optimization Algorithm(MWOA), an innovative metaheuristic algorithm derived from the classic WOA and tailored for bionics-inspired optimization. MWOA tackles common optimization problems like local optima and premature convergence using two key methods: shrinking encircling and spiral position updates. In essence, it prevents algorithms from settling for suboptimal solutions too soon, encouraging exploration of a broader solution space before converging, by incorporating cauchy variation and a perturbation term, MWOA achieve optimization over a wide search space. After that, comparisons were conducted between MWOA and seven recently proposed metaheuristics, utilizing the CEC2005 benchmark functions to assess MWOA's optimization performance. Moreover, the Wilcoxon rank sum test is used to verify the effectiveness of the proposed algorithm. Eventually, MWOA was juxtaposed with the BiLSTM classifier and six other meta-heuristics combined with the BiLSTM classifier. The aim was to affirm that MWOA-BiLSTM outperforms its counterparts, showcasing superior performance across crucial metrics such as accuracy, precision, recall, and F1-Score. The study results unequivocally demonstrate that MWOA showcases exceptional optimization capabilities, adeptly striking a harmonious balance between exploration and exploitation.

Self-learning salp swarm algorithm for global optimization and its application in multi-layer perceptron model training

Optimization problems are common across various fields, and one effective solution is the swarm intelligence algorithm.It is essential for the algorithm to deliver high-quality solutions for problems with varying characteristics. However, most existing swarm intelligence rely on fixed and monotonic search strategies, which limits their ability to handle the diverse and complex situations encountered when solving real-world optimization problems with unknown fitness landscapes. To extend the applicability of swarm intelligence and thus offer users an efficient black-box optimizer for various applications, a novel self-learning mechanism is proposed and applied to the Salp Swarm Algorithm (SSA) to develop the self-learning salp swarm algorithm (SLSSA) in this paper. In SLSSA, four distinct search strategies, including a novel multiple food sources search strategy, are adopted to strengthen the search agents’ abilities to conquer various difficulties in the search space. To improve the efficiency of the search process, the self-learning strategy dynamically determines the execution probability of each search strategy according to the quality of solutions it produced previously. Moreover, a parameter setting method is proposed in this paper, which eliminates the need for a trial-and-error approach and allows for straightforward configuration of the parameters that optimize the performance of SLSSA. In comparison with several highly regarded state-of-the-art peer algorithms, the performance of SLSSA in solving the CEC2014 benchmark functions was thoroughly examined. Subsequently, SLSSA was applied to train multi-layer perceptron classifiers and test on the UCI machine-learning datasets. The experimental results and analysis on benchmark functions and multi-layer perceptron classifier training problems demonstrate that SLSSA outperforms the competing algorithms in terms of solution accuracy, stability, and overall convergence speed. Moreover, computational time comparisons reveal that SLSSA achieves significant performance improvement with only a marginal increase in time cost compared to the original SSA.

A Novel Snow Leopard Optimization for High-Dimensional Feature Selection Problems.

To address the limitations of traditional optimization methods in achieving high accuracy in high-dimensional problems, this paper introduces the snow leopard optimization (SLO) algorithm. SLO is a novel meta-heuristic approach inspired by the territorial behaviors of snow leopards. By emulating strategies such as territory delineation, neighborhood relocation, and dispute mechanisms, SLO achieves a balance between exploration and exploitation, to navigate vast and complex search spaces. The algorithm's performance was evaluated using the CEC2017 benchmark and high-dimensional genetic data feature selection tasks, demonstrating SLO's competitive advantage in solving high-dimensional optimization problems. In the CEC2017 experiments, SLO ranked first in the Friedman test, outperforming several well-known algorithms, including ETBBPSO, ARBBPSO, HCOA, AVOA, WOA, SSA, and HHO. The effective application of SLO in high-dimensional genetic data feature selection further highlights its adaptability and practical utility, marking significant progress in the field of high-dimensional optimization and feature selection.

Improved sandcat swarm optimization algorithm for solving global optimum problems

The sand cat swarm optimization algorithm (SCSO) is a metaheuristic algorithm proposed by Amir Seyyedabbasi et al. SCSO algorithm mimics the predatory behavior of sand cats, which gives the algorithm a strong optimized performance. However, as the number of iterations of the algorithm increases, the moving efficiency of the sand cat decreases, resulting in the decline of search ability. The convergence speed of the algorithm gradually decreases, and it is easy to fall into local optimum, and it is difficult to find a better solution. In order to improve the search and movement efficiency of the sand cat, and enhance the global optimization ability and convergence performance of the algorithm, an improved sand cat Swarm Optimization (ISCSO) algorithm was proposed. In ISCSO algorithm, we propose a low-frequency noise search strategy and a spiral contraction walking strategy according to the habit of sand cat, and add random opposition-based learning and restart strategy. The frequency factor was used to control the search direction of the sand cat, and the spiral contraction hunting was carried out, which effectively improved the randomness of the population, expanded the search range of the algorithm, enhanced the moving efficiency of the sand cat, and accelerated the convergence speed of the algorithm. We use 23 standard benchmark functions and IEEE CEC2014 benchmark functions to compare ISCSO with 10 algorithms, and prove the effectiveness of the improved strategy. Finally, ISCSO was evaluated using five constrained engineering design problems. In the results of these problems, using ISCSO has 3.08%, 0.23%, 0.37%, 22.34%, 1.38% improvement compared with the original algorithm respectively, which proves the effectiveness of the improved strategy in practical application problems. The source code website for ISCSO is https://github.com/Ruiruiz30/ISCSO-s-code.

Multitask Level-Based Learning Swarm Optimizer.

Evolutionary multitasking optimization (EMTO) is currently one of the hottest research topics that aims to utilize the correlation between tasks to optimize them simultaneously. Although many evolutionary multitask algorithms (EMTAs) based on traditional differential evolution (DE) and the genetic algorithm (GA) have been proposed, there are relatively few EMTAs based on particle swarm optimization (PSO). Compared with DE and GA, PSO has a faster convergence speed, especially during the later state of the evolutionary process. Therefore, this paper proposes a multitask level-based learning swarm optimizer (MTLLSO). In MTLLSO, multiple populations are maintained and each population corresponds to the optimization of one task separately using LLSO, leveraging high-level individuals with better fitness to guide the evolution of low-level individuals with worse fitness. When information transfer occurs, high-level individuals from a source population are used to guide the evolution of low-level individuals in the target population to facilitate the effectiveness of knowledge transfer. In this way, MTLLSO can obtain the satisfying balance between self-evolution and knowledge transfer. We have illustrated the effectiveness of MTLLSO on the CEC2017 benchmark, where MTLLSO significantly outperformed other compared algorithms in most problems.

FOX-TSA: Navigating Complex Search Spaces and Superior Performance in Benchmark and Real-World Optimization Problems

In the dynamic field of optimisation, hybrid algorithms have garnered significant attention for their ability to combine the strengths of multiple methods. This study presents the Hybrid FOX-TSA algorithm, a novel optimisation technique that merges the exploratory capabilities of the FOX algorithm with the exploitative power of the TSA algorithm. The primary objective is to evaluate the efficiency, robustness, and scalability of this hybrid approach across multiple CEC benchmark suites, including CEC2014, CEC2017, CEC2019, CEC2020, and CEC2022, alongside real-world engineering design problems. The results demonstrate that the Hybrid FOX-TSA algorithm consistently outperforms established optimisation techniques, such as PSO, GWO, and the original FOX and TSA algorithms, in terms of convergence speed, solution quality, and computational efficiency. Notably, the hybrid approach avoids premature convergence and navigating complex search spaces, producing optimal or near-optimal solutions in various test cases. For instance, the algorithm achieved superior performance in minimizing design costs in the Pressure Vessel and Welded Beam Design problems, as well as effectively handling the complex landscapes of the CEC2020 and CEC2022 benchmarks. These results affirm the Hybrid FOX-TSA algorithm as a powerful and adaptable tool for tackling complex optimization problems, particularly in high-dimensional and multimodal landscapes. The integration of statistical analyses, such as t-tests and Wilcoxon signed-rank tests, further supports the statistical significance of its performance improvements.

Multi-Strategy Enhanced Parrot Optimizer: Global Optimization and Feature Selection.

Optimization algorithms are pivotal in addressing complex problems across diverse domains, including global optimization and feature selection (FS). In this paper, we introduce the Enhanced Crisscross Parrot Optimizer (ECPO), an improved version of the Parrot Optimizer (PO), designed to address these challenges effectively. The ECPO incorporates a sophisticated strategy selection mechanism that allows individuals to retain successful behaviors from prior iterations and shift to alternative strategies in case of update failures. Additionally, the integration of a crisscross (CC) mechanism promotes more effective information exchange among individuals, enhancing the algorithm's exploration capabilities. The proposed algorithm's performance is evaluated through extensive experiments on the CEC2017 benchmark functions, where it is compared with ten other conventional optimization algorithms. Results demonstrate that the ECPO consistently outperforms these algorithms across various fitness landscapes. Furthermore, a binary version of the ECPO is developed and applied to FS problems on ten real-world datasets, demonstrating its ability to achieve competitive error rates with reduced feature subsets. These findings suggest that the ECPO holds promise as an effective approach for both global optimization and feature selection.

Optimized bp Neural Network Based on Improved Dung Beetle Optimization Algorithm to Predict High-Performance Concrete Compressive Strength

In modern architecture, the structural safety of buildings largely depends on the compressive strength of high-performance concrete (HPC), which is determined by the complex nonlinear relationships between its components. In order to more accurately forecast HPC’s compressive strength, this paper proposes a prediction model based on an improved dung beetle optimization algorithm (OTDBO)-optimized backpropagation neural network (BPNN). Extreme Gradient Boosting (XGBoost) is employed to determine the inputs for the BPNN, enhancing the computational efficiency under high-dimensional data feature conditions. To address the issues of local optima entrapment and slow convergence in the dung beetle optimization algorithm (DBO), four improvements were made to enhance its performance. In the initial population generation stage, the optimal Latin hypercube method was used to increase the population diversity. In the rolling stage, the osprey optimization algorithm’s global exploration strategy was introduced to improve the global search capability. The variable spiral search strategy was employed in the reproduction stage, and an adaptive t-distribution perturbation strategy was combined in the foraging stage to enhance the algorithm’s adaptability and search efficiency. The improved dung beetle optimization algorithm (OTDBO) outperformed other algorithms in performance tests on the CEC2017 benchmark functions. In terms of predicting the compressive strength of HPC, the XG-OTDBO-BP model developed in this study outperformed models optimized by other algorithms in terms of fitting outcomes and prediction accuracy. These findings support the XG-OTDBO-BP model’s superiority in the compressive strength of HPC prediction.

Enhanced artificial hummingbird algorithm with chaotic traversal flight

Tackling the shortcomings of slow convergence, imprecision, and entrapment in local optima inherent in traditional meta-heuristic algorithms, this study presents the enhanced artificial hummingbird algorithm with chaotic traversal flight (CEAHA), which employs chaotic ergodicity within the foundational framework of the conventional artificial hummingbird algorithm. This approach implements chaotic motion within local regions of the solution space, ensuring a thorough exploration of potential optima and preventing algorithmic stagnation at local maxima by guaranteeing a non-repetitive traversal of all search states. This study also analyzes the intrinsic mechanisms by which eight different chaotic mappings affect optimization performance, from the perspectives of invariant measures and traversal efficiency of ergodic chaotic motion. In comparative tests with 21 meta-heuristic algorithms on the CEC2014, CEC2019, and CEC2022 benchmark suites across various dimensions, CEAHA demonstrates superior optimization performance. Furthermore, the practicability and robustness of CEAHA have been confirmed in mechanical design optimization problems through 4 engineering instances: pressure vessel, gear trains, speed reducers, and piston levers.

Solving UAV 3D Path Planning Based on the Improved Lemur Optimizer Algorithm.

This paper proposes an Improved Lemur Optimization algorithm (ILO), which combines the advantages of the Spider Monkey Optimization algorithm, Simulated Annealing algorithm, and Lemur Optimization algorithm. Through the use of an adaptive nonlinear decrement model, adaptive learning factors, and updated jump rates, the algorithm enhances its global exploration and local exploitation capabilities. A Gaussian function model is used to simulate the mountain environment, and a mathematical model for UAV flight is established based on constraints and objective functions. The fitness function is employed to determine the minimum cost for avoiding obstacles in a designated airspace, and cubic spline interpolation is used to smooth the flight path. The Improved Lemur Optimization algorithm was tested using the CEC2017 benchmark set, assessing its search capability, convergence speed, and accuracy. The simulation results show that ILO generates high-quality, smooth paths with fewer iterations, overcoming the issues of premature convergence and insufficient local search ability in traditional genetic algorithms. It adapts to complex terrain, providing an efficient and reliable solution.

Multi-Strategy Bald Eagle Search Algorithm Embedded Orthogonal Learning for Wireless Sensor Network (WSN) Coverage Optimization.

Coverage control is a fundamental and critical issue in plentiful wireless sensor network (WSN) applications. Aiming at the high-dimensional optimization problem of sensor node deployment and the complexity of the monitoring area, an orthogonal learning multi-strategy bald eagle search (OLMBES) algorithm is proposed to optimize the location deployment of sensor nodes. This paper incorporates three kinds of strategies into the bald eagle search (BES) algorithm, including Lévy flight, quasi-reflection-based learning, and quadratic interpolation, which enhances the global exploration ability of the algorithm and accelerates the convergence speed. Furthermore, orthogonal learning is integrated into BES to improve the algorithm's robustness and premature convergence problem. By this way, population search information is fully utilized to generate a more superior position guidance vector, which helps the algorithm jump out of the local optimal solution. Simulation results on CEC2014 benchmark functions reveal that the optimization performance of the proposed approach is better than that of the existing method. On the WSN coverage optimization problem, the proposed method has greater network coverage ratio, node uniformity, and stronger optimization stability when compared to other state-of-the-art algorithms.