A modified Aquila optimizer algorithm for optimization energy-efficient no-idle permutation flow shop scheduling problem

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.

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.

The grey wolf optimization (GWO) algorithm was proposed in 2014 and after several years of applications, it was used worldwide and all over the subjects which involved computation. Various improvements have been raised to increase the capability of optimization. Based on the best performance of the slimd mould (SM) algorithm in optimization, a hybridization of the SM and GWO algorithms was proposed about the updating equations, and the GWO algorithm with multiple tunnels for individuals to update their positions during iterations was revised. Simulation experiments were carried out and comparisons were made between the GWO algorithm with variable weights and our proposed new one. Better performance were confirmed and reported as conclusions.

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.

SummaryThe search for an effective nature‐inspired optimization technique has certainly continued for decades. This work proposes a novel robust multi‐user detection algorithm based on Grey wolf optimization and differential evolution algorithm to overcome the problem of high bit error rate (BER) in multi‐user detection under an impulse noise environment. The simulation results show that the iteration times of the multi‐user detector based on the proposed algorithm is less than those of genetic algorithm, differential evolution algorithm, Grey wolf optimization algorithm, salp swarm algorithm, grasshopper optimisation algorithm, and whale optimization algorithm with the lowerst BER value.

A Grey-Wolf optimization (GWO) algorithm served for fiber Bragg grating (FBG) strain sensor in structure detection is developed in this paper. A strain profile demodulation method of FBG reflection spectrum based on GWO algorithm is proposed, which uses an improved transfer matrix method for calculation. The GWO algorithm simulates the leadership and hunting mechanism of gray wolves in nature. For leadership, it has four types of gray wolves, such as α, β, δ, and ω wolves. Additionally, three main steps of hunting, searching, surrounding and attacking prey have also been simulated. On this basis, the reconstructed non-uniform strain profile by GWO algorithm was verified by a comprehensive numerical simulation. And the simulation results verify the accuracy and effectiveness of the GWO method. The calculation example shows that the target strain profile is in good agreement with the reconstructed strain profile.

Photovoltaics are becoming very popular, because the system does not produce pollution and can be installed anywhere, including in remote areas. However, in the use of photovoltaic found some common problems, it is difficult to get maximum and stable power. Therefore, to overcome these problems using Maximum Power Point Tracking method. On a photovoltaic system it is necessary to determine which converter will be used to increase the power output of the photovoltaic. The design of MPPT using gray wolf optimization algorithm that can track the output power quickly and reduce the oscillation in photovoltaic system. The result of the maximum power tracker using the gray wolf optimization algorithm is better than the incremental conductance algorithm of up to 0,4 s. Converters are used using soft - switching buck converter method to overcome the power losses that often arise in PV systems. The result of power output using soft-switching buck converter is greater than using buck converter. When comparing the efficiency of photovoltaic systems using the gray wolf optimization algorithm increases from using the incremental conductance algorithm.

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

PurposeSea Lion Optimization (SLnO) algorithm involves the ability of exploration and exploitation phases, and it is able to solve combinatorial optimization problems. For these reasons, it is considered a global optimizer. The scheduling operation is completed by imitating the hunting behavior of sea lions.Design/methodology/approachCloud computing (CC) is a type of distributed computing, contributory in a massive number of available resources and demands, and its goal is sharing the resources as services over the internet. Because of the optimal using of these services is everlasting challenge, the issue of task scheduling in CC is significant. In this paper, a task scheduling technique for CC based on SLnO and multiple-objective model are proposed. It enables decreasing in overall completion time, cost and power consumption; and maximizes the resources utilization. The simulation results on the tested data illustrated that the SLnO scheduler performed better performance than other state-of-the-art schedulers in terms of makespan, cost, energy consumption, resources utilization and degree of imbalance.FindingsThe performance of the SLnO, Vocalization of Whale Optimization Algorithm (VWOA), Whale Optimization Algorithm (WOA), Grey Wolf Optimization (GWO) and Round Robin (RR) algorithms for 100, 200, 300, 400 and 500 independent cloud tasks on 8, 16 and 32 VMs was evaluated. The results show that SLnO algorithm has better performance than VWOA, WOA, GWO and RR in terms of makespan and imbalance degree. In addition, SLnO exhausts less power than VWOA, WOA, GWO and RR. More precisely, SLnO conserves 5.6, 21.96, 22.7 and 73.98% energy compared to VWOA, WOA, GWO and RR mechanisms, respectively. On the other hand, SLnO algorithm shows better performance than the VWOA and other algorithms. The SLnO algorithm's overall execution cost of scheduling the cloud tasks is minimized by 20.62, 39.9, 42.44 and 46.9% compared with VWOA, WOA, GWO and RR algorithms, respectively. Finally, the SLnO algorithm's average resource utilization is increased by 6, 10, 11.8 and 31.8% compared with those of VWOA, WOA, GWO and RR mechanisms, respectively.Originality/valueTo the best of the authors’ knowledge, this work is original and has not been published elsewhere, nor is it currently under consideration for publication elsewhere.

This paper introduces an application of the dandelion optimization (DO) algorithm in antenna arrays. This is the first time that the DO algorithm has been used for optimizing antenna arrays. For antenna array optimization, sidelobe level (SLL) and deep nulls are key technical indicators. A lower SLL can improve the signal-to-noise ratio and reduce the impact of clutter signals outside the main beam. Deep nulls need to be aligned with the direction of interference to eliminate the influence of interference sources. The combination of the two can effectively improve the anti-interference ability of the entire system. Therefore, antenna arrays with ultra-low sidelobes and ultra-deep nulls are currently hot in the field of antenna array design and are also some of the key technologies needed to achieve modern high-performance radar systems. As a new type of evolutionary algorithm inspired by nature, the DO algorithm is inspired by the wind propagation behavior of dandelions in nature. This algorithm iteratively updates the population from three stages of ascent, descent, and landing, ultimately finding the optimal position. It has good optimization ability in solving complex problems such as those involving nonlinearity, discreteness, and non-convexity, and the antenna array pattern synthesis optimization problem belongs to multivariate nonlinear problems. Therefore, the DO algorithm can be effectively applied in the field of antenna array optimization. In this work, we use the following method to obtain an optimized pattern of a linear array with the lowest sidelobe level (SLL), null placement in particular directions, and a lower notch in particular directions: by controlling the antenna array’s element spacing and leaving the phase unchanged to optimize the current amplitudes and by controlling the excitation current and phase fixation of the antenna array and changing the element spacing. In the first and second examples, different algorithms are used to reduce the SLL of the antenna. In the first example, the DO algorithm reduces the SLL to −33.37 dB, which is 2.67 dB, 2.67 dB, 3.77 dB, 2.74 dB, and 2.52 dB lower than five other algorithms. In the second example, the SLL optimized by the DO algorithm is −42.56 dB, which is 5.04 dB and 1.48 dB lower than two other algorithms. In both examples, the DO algorithm reduces the SLL lower than other algorithms when the main lobe of the antenna is not significantly widened. Examples 3, 4, and 5 use the DO algorithm to optimize the amplitude of the current, generating deep nulls and deep notches in specific directions. In Example 3, the DO algorithm obtains a depth of nulls equal to −187.6 dB, which is 66.7 dB and 44.3 dB lower than that of the flower pollination algorithm (FPA) and the chaotic colony predation algorithm (CCPA), respectively. In Example 4, the deep null obtained by the DO algorithm is as low as −98.69 dB, which is 6.67 dB lower than the deep null obtained by the grey wolf optimization (GWO) algorithm. In Example 5, the deep notch obtained by the DO algorithm is as low as −63.1 dB, which is 6.4 dB and 1.9 dB lower than the spider monkey optimization (SMO) algorithm and the grasshopper optimization algorithm (GOA), respectively. The data prove that the DO algorithm produces deeper nulls and notches than other algorithms. The last two examples involve reducing sidelobe levels and generating deep nulls by optimizing the spacing between elements. In Example 5, the SLL obtained using the DO algorithm is −22.8766 dB, which is 0.1998 dB lower than the lowest SLL of −22.6768 dB among other algorithms. In Example 6, the SLL obtained using the DO algorithm is −20.1012 dB, and the null depth is −125.1 dB, which is 1.592 dB lower than the SLL obtained by the cat swarm optimization (CSO) algorithm and 19.1 dB lower than the deep null obtained by the GWO algorithm, respectively. In summary, the results of six simulation experiments indicate that the DO algorithm has better optimization ability in linear array optimization than other evolutionary algorithms.

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.

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.

Grey-Wolf Optimizer (GWO) and Salp-Swarm Algorithm (SSA) are among the recent metaheuristic algorithms that have shown considerable potential in solving practical problems. Nevertheless, these optimisation methods usually suffer from a poor performance, especially when dealing with multimodal and high-dimensional problems. To overcome drawbacks of these algorithms, a new population-based global optimisation algorithm inspired by GWO and SSA is proposed in this paper. The basic idea behind the proposed approach is to divide the population into two groups that adopt new position updating strategies. The movement method of the first group is inspired by the hunting mechanism used in GWO algorithm. On the other hand, the population of the second group moves into the search space using a new strategy based on the position updating method employed by the follower salps in SSA. The performances of the proposed algorithm, named GW-SSA, have been studied through 23 benchmark functions of different types and dimensions. The obtained results were statistically analysed using Wilcoxon signed-rank. Furthermore, GW-SSA algorithm has been applied to solve four real engineering design problems. The experimental results show the superior performance of GW-SSA compared to GWO, SSA and other recently proposed optimisation algorithms.

To increase the optimal allocation level of military transportation resources, on the basis of built aviation network, a route planning method based on Gray Wolf Optimization (GWO) algorithm is proposed for military transport aircraft. First, applying the relevant knowledge of graph theory, the aviation network model is established; then, GWO algorithm is introduced to optimize the flight path on the built aviation network for route planning of military transport aircraft. The simulation shows that the proposed method has the characteristics of fast convergence, high efficiency, practicability and easy implementation, and can solve the route planning problem of military transport aircraft well.