Magnetic targets positioning method based on multi-strategy improved Grey Wolf optimizer

Optimal design of mixed dielectric coaxial-annular TSV using GWO algorithm based on artificial neural network

Improved grey wolf optimizer based on neighborhood trust model for parameter identification of PEMFC

Aiming at the defects of the Aquila optimizer (AO) in dealing with some complex optimization problems, such as slow convergence speed, low convergence accuracy, and easy to fall into local optimum, in this paper, a hybrid Aquila optimizer (HAO) algorithm based on Gauss map and crisscross operator is proposed. First, Gauss map is introduced to initialize the Aquila population to improve the quality of the initial population. Then use the crisscross operator to promote the exchange of information within the population and maintain the diversity of the population in each iteration, which not only enhances the ability of the algorithm to jump out of the local optimum but also accelerates the global convergence of the algorithm. The results of experiments using 21 classical benchmark functions indicate that HAO has better global search ability, faster convergence speed, and better stability than AO. The overall optimization performance of HAO in different dimensions is better than particle swarm optimization (PSO) algorithm, gray wolf optimization (GWO) algorithm, whale optimization algorithm (WOA), and crisscross optimization (CSO) algorithm. Finally, the results of K-means clustering optimization on six University of California (UCI) standard data sets demonstrate that HAO has significant advantages over three algorithms that are good at clustering optimization.

Optimizing the crop cultivation pattern, in order to reduce water consumption, in arid and semi-arid regions such as Iran, due to water scarcity and food intake, is an essential solution for food intakes needs. Optimizing the crop cultivation pattern, in order to reduce water consumption, in arid and semi-arid regions such as Iran, due to water scarcity and food intake, is an essential solution for food intakes needs. In this study, new methods based on the election algorithms (EA) and gray wolf optimizer (GWO) algorithms were used to determine the optimal cultivation pattern in Moghan plain during the statistical years of 2007-2016. The objective function in the agricultural sector was based on each product and its yield, net from each product and the cultivar. Then, maximization of the objective function was performed using GWO and EA algorithm. The results of using GWO algorithm in determining the optimal crop pattern in Moghan plain showed that using economic policies such as changing the cultivar pattern, we can obtain a better result compared to EA algorithm in the agricultural sector. In general, the results of GWO algorithm showed that in the Moghan plain with 0.9, 140 billion rials, that is, about 42 % will have economic growth. In sum, the results showed that GWO algorithm with high values of statistical criteria (R2=0.96, RMSE=0.022 and NSE=0.75) has a higher efficiency in optimizing the crop cultivation pattern of Moghan plain, which can be applied to the correct planning for other cultivation areas to be employed.

To address the critical limitations of conventional Grey Wolf Optimization (GWO) in path planning scenarios—including insufficient exploration capability during the initial phase, proneness to local optima entrapment, and inherent deficiency in dynamic obstacle avoidance—this paper proposes a multi-strategy enhanced GWO algorithm. Firstly, the Piecewise chaotic mapping is applied to initialize the Grey Wolf population, enhancing the initial population quality. Secondly, the linear convergence factor is modified to a nonlinear one to balance the algorithm’s global and local search capabilities. Thirdly, Evolutionary Population Dynamics (EPD) is incorporated to enhance the algorithm’s ability to escape local optima, and dynamic weights are used to improve convergence speed and accuracy. Finally, the algorithm is integrated with the Improved Dynamic Window Approach (IDWA) to enhance path smoothness and perform dynamic obstacle avoidance. The proposed algorithm is named PAGWO-IDWA. The results demonstrate that, compared to traditional GWO, PAGWO-IDWA reduces the path length, number of turns, and running time by 9.58%, 33.16%, and 30.31%, respectively. PAGWO-IDWA not only overcomes the limitations of traditional GWO but also enables effective path planning in dynamic environments, generating paths that are both safe and smooth, thus validating the effectiveness of the algorithm.

A grey wolf optimization algorithm based on an adaptive adjustment strategy (Improvements-Grey Wolf Optimization, IGWO) is proposed in this paper to address the issues with the Grey Wolf Optimization (GWO) algorithm, which has a slow convergence speed in the later stages and where the local search and global search cannot be taken into effective balance. First, a chaotic logistic map is used to initialize the population. Next, an inverse trigonometric function-based mathematical model is developed to achieve convergence purposes. Finally, a new location update method is used to update the next-generation location to improve search traversability. Additionally, the CEC2013-Benchmark standard test function was used to evaluate the benefits of performance compared to the standard GWO, PSO, and DEGWO (DE-Grey wolf optimization) algorithms. The improved GWO algorithm has greatly increased the convergence speed, search capability, and stability. It performs better than the other three algorithms as well.

Generally, optimization is defined as the process of determining the minimum or maximum value that depends on the function of the goal, even now there are many problems regarding optimization. One of them is the problem regarding the selection of goods to be included in a limited storage medium called Knapsack problem. Knapsack problems have different types and variations. This study will solve the problem of bounded knapsack multiple constraints by implementing the Grey Wolf Optimizer (GWO) algorithm. The problem of bounded knapsack multiple constraints has more than one subject with the items that are inserted into the dimension storage media can be partially or completely inserted, but the number of objects is limited. The aim of this study is to determine the results of using the Grey Wolf Optimizer (GWO) algorithm for solving the problem of multiple constraints bounded knapsack and compare the optimal solutions obtained by the simplex method using the Solver Add-In in Microsoft Excel. The data used in this study is primary data. There are two parameters to be tested, namely population parameters and maximum iteration. The test results of the two parameters show that the population parameters and maximum iterations have the same effect, where the greater the value of the population parameters and the maximum iteration, the results obtained are also getting closer to the optimal value. In addition, based on the results of the final experiment it is known that the comparison of the results of the GWO algorithm and the simplex method has a fairly small percentage deviation which indicates that the GWO algorithm produces results that are close to the optimal value.
 Keywords: GWO algorithm, Knapsack, Multiple Constraints Bounded Knapsack.

The emergence of wireless sensor network (WSN) makes the communication between people and things more extensive, and provides a new way for people to obtain information and more accurate real‐time communication. However, the regional distance in WSN is still a big problem. This method can not only optimize the cluster structure, but also reduce the number of member nodes in the cluster, the cluster head receiving energy, and reduce the data transmission distance between nodes. At the same time, the number of packets received by the base station increases, so that more sensing information can be obtained. The simulation results showed that compared with the smart Ethernet protection (SEP) protocol and the low energy adaptive clustering hierarchy (LEACH) protocol, the number of first node deaths (FND) of the grey wolf optimizer (GWO) algorithm was 153 and 233 times different from those of the SEP and LEACH protocols respectively at 100m*100m. In the case of 200m*200m, compared with that of SEP and LEACH, the number of FND of GWO was 152 and 200 times different. Finally, in the case of 300m*300m, compared with that of SEP and LEACH, the number of FND of GWO was 142 and 158 times different. The GWO algorithm has a higher node ARE ratio in a wider region. In the same 1000 rounds, the node ARE of GWO was 61%, while the node ARE of SEP and LEACH protocols were 7% and 3%, respectively. From the above results, it can be found that the GWO algorithm has been greatly improved in terms of network energy efficiency, network lifetime, etc., and can still work normally under larger scale monitoring. The innovation of this article lies in the localization problem of fixed node mobile sensor networks, proposing a mobile sensor network localization method based on mobile error nodes. This can optimize the distance between nodes and improve the positioning accuracy of the algorithm in both distributed and centralized situations. This article is protected by copyright. All rights reserved.

This paper presents the recently developed Grey Wolf Optimization (GWO) algorithm, which is based on the food collecting behavior of grey wolves to determining the feasible optimal solution of the multi objective environmental economic dispatch (MOEED) problem. Nonlinear characteristics of alternators and exponential emissions and loss minimization are considered in the problem. While searching for a better solution, GWO does not require any statistics about the gradient of the objective function. The GWO algorithm effectiveness has been tested on four different systems as 6-unit (IEEE 30-bus), 10-unit, 11-unit and 14-unit (IEEE 118-bus) test systems to solve the MOEED problems. The result of the test systems shows, for practical power systems GWO as a better option to solve the MOEED problems. Both the optimality of the solution to test systems and the convergence speed of the GWO algorithm are promising.

The Black-winged Kite Algorithm (BKA) is a novel heuristic optimization algorithm proposed in 2024, which has demonstrated superior optimization performance on most CEC benchmark functions and several engineering problems. To further enhance its convergence accuracy and solution quality, this paper proposes a Modified Black-winged Kite Algorithm (MBKA). First, a three-phase attacking strategy is designed to replace the original BKA’s attacking mechanism, thereby enhancing population diversity and improving solution quality. Additionally, a Lévy–Cauchy migration strategy is incorporated to achieve a more effective balance between exploration and exploitation. The effectiveness of MBKA is assessed through extensive experiments on 18 classical benchmark functions, the CEC-2017 and CEC-2022 test suites, and two real-world engineering optimization problems. The results indicate that MBKA consistently outperforms the original BKA and several state-of-the-art algorithms in both convergence accuracy and convergence speed across most test cases.

This paper proposes a golden sine grey wolf optimizer (GSGWO) that can be adapted to the obstacle-crossing function to solve the path planning problem of obstacle-crossable robot. GSGWO has been improved from the gray wolf optimizer (GWO), which provide slow convergence speed and easy to fall into local optimum, especially without obstacle-crossing function. Firstly, aiming at the defects of GWO, the chaotic map is introduced to enrich the initial population and improve the convergence factor curve. Then, the convergence strategy of the golden sine optimizer is introduced to improve the shortcomings of GWO, such as insufficient convergence speed in the later stage and the ease with which it falls into the local optimum. Finally, by adjusting the working environment model, path generation method and fitness function, the path-planning problem of the obstacle-crossing robot is adapted. In order to verify the feasibility of the algorithm, four standard test functions and three different scale environment models are selected for simulation experiments. The results show that in the performance test of the algorithm, the GSGWO has higher convergence speed and accuracy than the GWO under different test functions. In the path-planning experiment, the length, number and size of inflection points and stability of the path planned by the GSGWO are better than those of the GWO. The feasibility of the GSGWO is verified.

Biodiesel manufacturing from renewable feedstocks has received a lot of attention as a viable alternative to fossil fuels. The Box-Behnken design, analysis of variance (ANOVA), and the Grey Wolf Optimizer (GWO) algorithm were used in this work to optimise biodiesel production from Nahar oil. The goal was to determine the best operating parameters for maximising biodiesel yield. The Box-Behnken design is used, with four essential parameters taken into account: molar ratio, reaction duration and temperature, and catalyst weight percentage. The response surface is studied in this design, and the key factors influencing biodiesel yield are discovered. The gathered data is given to ANOVA analysis to determine the statistical significance. ANOVA analysis is performed on the acquired data to determine the statistical significance of the components and their interactions. The GWO algorithm is used to better optimise the biodiesel production process. Based on the data provided, the GWO algorithm obtains an optimised yield of 91.6484% by running the reaction for 200 minutes, using a molar ratio of 7, and a catalyst weight percentage of 1.2. As indicated by the lower boundaries, the reaction temperature ranges from 50 °C. The results show that the Box-Behnken design, ANOVA, and GWO algorithm were successfully integrated for optimising biodiesel production from Nahar oil. This method offers useful insights into process optimisation and indicates the possibilities for increasing the efficiency and sustainability of biodiesel production. Further study can broaden the use of these strategies to various biodiesel production processes and feedstocks, advancing sustainable energy technology.

Transformer-based decoder of melanoma classification using hand-crafted texture feature fusion and Gray Wolf Optimization algorithm

Wastewater treatment plants (WWTP), as common integrated energy systems (IES), efficiently manage electrical and thermal demands while utilizing renewable energy and biomass resources. This paper proposes an optimal scheduling framework for WWTP, covering gas turbines, gas boilers, electric boilers, photovoltaics, wind turbines, biomass generators, and energy storage devices. An enhanced Grey Wolf Optimization (GWO) algorithm is compared with the Mixed-Integer Linear Programming (MILP) method solved by CPLEX. Simulation results show that the total cost achieved by the GWO algorithm is 0.43% lower than that of the MILP algorithm, with the operating cost reduced by 6.39% and the carbon cost reduced by 10.95%. Although the utilization rate of renewable energy is lower than that of MILP, GWO demonstrates higher cost efficiency, flexibility in handling complex constraints, accessibility without commercial solvers, and robustness to uncertainties. These characteristics make GWO a practical and effective solution for optimizing energy management in WWTP.

Spherical search algorithm (SS) was a swarm-based meta-heuristic recently proposed to solve the bound-constrained non-linear global optimization problems. It has quite competitive performance with respect to other popular algorithms. Nevertheless, it still has several defects, such as it can’t easily get rid of the situation that falls into the local optimal and its convergence speed is slow under the condition that the spherical space is much too large. As grey wolf optimization (GWO) algorithm has good abilities of minimizing the global search space and local area avoidance, the search mechanism of GWO by serial pattern is studied and combined with SS to improve its balance between exploration and exploitation. The new spherical search and grey wolf optimization algorithm algorithm we proposed is called SSGWO, and its superiority is demonstrated with experimental results based on 30 benchmark functions of IEEE CEC2017 in comparison with its component algorithms.