Elite Opposition-based Learning Research Articles

Identifying rice lodging based on semantic segmentation architecture optimization with UAV remote sensing imaging

Lodging, a prevalent issue during rice growth, detrimentally impacts both yield and quality. It also complicates the harvesting process, reducing the efficiency of mechanized collection. Existing monitoring methods, predominantly based on manual observation and satellite remote sensing, fall short in addressing the requirements of contemporary, efficient, and real-time agriculture. This research integrates image analysis techniques with advanced optimization algorithms to develop a semantic segmentation model specifically designed for detecting rice lodging in remote sensing images. The model, named MI-UConvNeXt, employs a ConvNeXt-based feature extraction network utilizing UNet architecture (UConvNeXt) and incorporates an improved multi-objective salp swarm algorithm with Latin hypercube sampling and an elite opposition-based learning strategy (ISSA-LE) to dynamically adjusting the number of UConvNeXt channels. MI-UConvNeXt achieves a balance between accuracy and complexity. Compared to seven other semantic segmentation models from the literature, MI-UConvNeXt exhibits enhanced performance, with a Pixel Accuracy (PA) of 95.59%, mean Pixel Accuracy (mPA) of 95.62%, and mean Intersection over Union (mIoU) of 91.91% on the validation set. This demonstrates the model’s superior accuracy, lower computational resource demands, and enhanced efficiency. By integrating deep learning with intelligent optimization algorithms, this study offers a novel and effective approach for monitoring crop lodging in agricultural production, providing robust technical support for the accurate extraction of crop phenotypic information.

A novel hybrid algorithm based on improved marine predators algorithm and equilibrium optimizer for parameter extraction of solar photovoltaic models

In the field of solar photovoltaic (PV) systems, the accurate and reliable extraction of parameters from PV models is crucial for effective simulation, evaluation, and control. Although various optimization algorithms have been widely used for parameter extraction in solar PV systems, the accuracy and reliability of the parameters extracted by these methods usually fall short of the expected standards. To address these shortcomings, a novel hybrid algorithm that combines the improved marine predators algorithm (MPA) with the equilibrium optimizer (EO), named IMPAEO, is proposed. In the IMPAEO, an elite opposition-based learning strategy is introduced to expand the exploration range of the algorithm to enhance population diversity; an adaptive weight coefficient is employed to improve the updating rule of the MPA, facilitating a balance between global exploration and local exploitation; the EO operator is integrated to enhance the performance of the MPA in the local exploitation phase to improve the solution quality and convergence speed; and the linear population size reduction (LPSR) technique is introduced to dynamically reduce the population size and improve the search performance. The effectiveness of the proposed IMPAEO is validated using the CEC2017 benchmark test suite, which is also applied to extract parameters of the single diode model, the double diode model, and three different PV modules. Comparative analysis with other algorithms demonstrates that the IMPAEO exhibits significant advantages in terms of solution quality, convergence speed, and algorithm stability. Consequently, the proposed IMPAEO not only proves to be efficient and reliable in parameter extraction for solar PV models but also offers a promising alternative in this field.

Somersault Foraging and Elite Opposition-Based Learning Dung Beetle Optimization Algorithm

To tackle the shortcomings of the Dung Beetle Optimization (DBO) Algorithm, which include slow convergence speed, an imbalance between exploration and exploitation, and susceptibility to local optima, a Somersault Foraging and Elite Opposition-Based Learning Dung Beetle Optimization (SFEDBO) Algorithm is proposed. This algorithm utilizes an elite opposition-based learning strategy as the method for generating the initial population, resulting in a more diverse initial population. To address the imbalance between exploration and exploitation in the algorithm, an adaptive strategy is employed to dynamically adjust the number of dung beetles and eggs with each iteration of the population. Inspired by the Manta Ray Foraging Optimization (MRFO) algorithm, we utilize its somersault foraging strategy to perturb the position of the optimal individual, thereby enhancing the algorithm’s ability to escape from local optima. To verify the effectiveness of the proposed improvements, the SFEDBO algorithm is utilized to optimize 23 benchmark test functions. The results show that the SFEDBO algorithm achieves better solution accuracy and stability, outperforming the DBO algorithm in terms of optimization results on the test functions. Finally, the SFEDBO algorithm was applied to the practical application problems of pressure vessel design, tension/extension spring design, and 3D unmanned aerial vehicle (UAV) path planning, and better optimization results were obtained. The research shows that the SFEDBO algorithm proposed in this paper is applicable to actual optimization problems and has better performance.

An Enhanced Symmetric Sand Cat Swarm Optimization with Multiple Strategies for Adaptive Infinite Impulse Response System Identification

An infinite impulse response (IIR) system might comprise a multimodal error surface and accurately discovering the appropriate filter parameters for system modeling remains complicated. The swarm intelligence algorithms facilitate the IIR filter’s parameters by exploring parameter domains and exploiting acceptable filter sets. This paper presents an enhanced symmetric sand cat swarm optimization with multiple strategies (MSSCSO) to achieve adaptive IIR system identification. The principal objective is to recognize the most appropriate regulating coefficients and to minimize the mean square error (MSE) between an unidentified system’s input and the IIR filter’s output. The MSSCSO with symmetric cooperative swarms integrates the ranking-based mutation operator, elite opposition-based learning strategy, and simplex method to capture supplementary advantages, disrupt regional extreme solutions, and identify the finest potential solutions. The MSSCSO not only receives extensive exploration and exploitation to refrain from precocious convergence and foster computational efficiency; it also endures robustness and reliability to facilitate demographic variability and elevate estimation precision. The experimental results manifest that the practicality and feasibility of the MSSCSO are superior to those of other methods in terms of convergence speed, calculation precision, detection efficiency, regulating coefficients, and MSE fitness value.

Improved whale optimization algorithm towards precise state-of-charge estimation of lithium-ion batteries via optimizing LSTM

Accurate state-of-charge (SOC) estimation is a crucial part of the battery management system (BMS). However, conventional estimation methods are unable to capture the extremely complex dynamic characteristics of lithium-ion batteries. Besides, manually setting the optimal hyperparameters of models has many drawbacks. To address the problems, an (improved whale optimization algorithm) IWOA- (long short-term memory) LSTM model is proposed in this work. Utilizing the whale optimization algorithm (WOA) improved with four enhancement strategies (Gaussian chaotic mapping initialization, Nonlinear weight update, Lévy flight mechanism, and Elite opposition-based learning) to optimize the number of hidden layer nodes, the learning rate, and the number of iterations of LSTM model. It not only overcomes the shortcomings of artificially setting LSTM hyperparameters but also further boosts the learning ability of the IWOA-LSTM model, making the model more suitable for SOC estimation under different scenarios. The evaluation results show that the MAE of the proposed model for SOC estimation results is lower than 0.8 % under different temperatures and dynamic conditions. Compared with SOTA models, all MAE, RMSE, and MAPE of the proposed model substantially decline. Furthermore, the R2 of the estimation results using the LG dataset in Experiment Ⅲ is 98.65 %, suggesting the applicability of the proposed model to Li-ion batteries from various manufacturers. The experimental results demonstrate the proposed IWOA-LSTM model is suitable for accurate SOC estimation.

Novel Multi-Classification Dynamic Detection Model for Android Malware Based on Improved Zebra Optimization Algorithm and LightGBM.

With the increasing popularity of Android smartphones, malware targeting the Android platform is showing explosive growth. Currently, mainstream detection methods use static analysis methods to extract features of the software and apply machine learning algorithms for detection. However, static analysis methods can be less effective when faced with Android malware that employs sophisticated obfuscation techniques such as altering code structure. In order to effectively detect Android malware and improve the detection accuracy, this paper proposes a dynamic detection model for Android malware based on the combination of an Improved Zebra Optimization Algorithm (IZOA) and Light Gradient Boosting Machine (LightGBM) model, called IZOA-LightGBM. By introducing elite opposition-based learning and firefly perturbation strategies, IZOA enhances the convergence speed and search capability of the traditional zebra optimization algorithm. Then, the IZOA is employed to optimize the LightGBM model hyperparameters for the dynamic detection of Android malware multi-classification. The results from experiments indicate that the overall accuracy of the proposed IZOA-LightGBM model on the CICMalDroid-2020, CCCS-CIC-AndMal-2020, and CIC-AAGM-2017 datasets is 99.75%, 98.86%, and 97.95%, respectively, which are higher than the other comparative models.

An Improved Binary Walrus Optimizer with Golden Sine Disturbance and Population Regeneration Mechanism to Solve Feature Selection Problems.

Feature selection (FS) is a significant dimensionality reduction technique in machine learning and data mining that is adept at managing high-dimensional data efficiently and enhancing model performance. Metaheuristic algorithms have become one of the most promising solutions in FS owing to their powerful search capabilities as well as their performance. In this paper, the novel improved binary walrus optimizer (WO) algorithm utilizing the golden sine strategy, elite opposition-based learning (EOBL), and population regeneration mechanism (BGEPWO) is proposed for FS. First, the population is initialized using an iterative chaotic map with infinite collapses (ICMIC) chaotic map to improve the diversity. Second, a safe signal is obtained by introducing an adaptive operator to enhance the stability of the WO and optimize the trade-off between exploration and exploitation of the algorithm. Third, BGEPWO innovatively designs a population regeneration mechanism to continuously eliminate hopeless individuals and generate new promising ones, which keeps the population moving toward the optimal solution and accelerates the convergence process. Fourth, EOBL is used to guide the escape behavior of the walrus to expand the search range. Finally, the golden sine strategy is utilized for perturbing the population in the late iteration to improve the algorithm's capacity to evade local optima. The BGEPWO algorithm underwent evaluation on 21 datasets of different sizes and was compared with the BWO algorithm and 10 other representative optimization algorithms. The experimental results demonstrate that BGEPWO outperforms these competing algorithms in terms of fitness value, number of selected features, and F1-score in most datasets. The proposed algorithm achieves higher accuracy, better feature reduction ability, and stronger convergence by increasing population diversity, continuously balancing exploration and exploitation processes and effectively escaping local optimal traps.

Wind Speed Forecasting Based on Phase Space Reconstruction and a Novel Optimization Algorithm

The wind power generation capacity is increasing rapidly every year. There needs to be a corresponding development in the management of wind power. Accurate wind speed forecasting is essential for a wind power management system. However, it is not easy to forecast wind speed precisely since wind speed time series data are usually nonlinear and fluctuant. This paper proposes a novel combined wind speed forecasting model that based on PSR (phase space reconstruction), NNCT (no negative constraint theory) and a novel GPSOGA (a hybrid optimization algorithm that combines global elite opposition-based learning strategy, particle swarm optimization and the genetic algorithm) optimization algorithm. SSA (singular spectrum analysis) is firstly applied to decompose the original wind speed time series into IMFs (intrinsic mode functions). Then, PSR is employed to reconstruct the intrinsic mode functions into input and output vectors of the forecasting model. A combined forecasting model is proposed that contains a CBP (cascade back propagation network), RNN (recurrent neural network), GRU (gated recurrent unit), and CNNRNN (convolutional neural network combined with recurrent neural network). The NNCT strategy is used to combine the output of the four predictors, and a new optimization algorithm is proposed to find the optimal combination parameters. In order to validate the performance of the proposed algorithm, we compare the forecasting results of the proposed algorithm with different models on four datasets. The experimental results demonstrate that the forecasting performance of the proposed algorithm is better than other comparison models in terms of different indicators. The DM (Diebold–Mariano) test, Akaike’s information criterion and the Nash–Sutcliffe efficiency coefficient confirm that the proposed algorithm outperforms the comparison models.

High-speed 3D printing temperature system with optimized PlD parameters based on improved ant lion optimization algorithm

An Ant Lion Optimization algorithm based on elite Opposition-based learning and Cosine factors (OCALO) is proposed to address the problem of poor response and stability during heating process in high-speed 3D printing temperature system.The generation of the initial solution in OCALO algorithm is enhanced by the introduction of a new Tent-Logistic-Cotangent composite chaotic mapping, which guarantees the diversity of population. The PID parameters are optimized using the improved algorithm. Compared with two existing classical algorithms and three improved ALO algorithms, the proposed algorithm improves the convergence speed, global search ability and the ability to jump out of the local optimal solution. The outcomes of simulation and experimentation demonstrate that the algorithm improves the transient and steady-state performance of temperature control with better accuracy and robustness. It takes at least 123 s faster than other controllers to reach stability and is more than two times stronger than other PID controllers, making it better suited to high-speed 3D printing temperature systems.

Correction: Enhanced coati optimization algorithm using elite opposition-based learning and adaptive search mechanism for feature selection

Correction: Enhanced coati optimization algorithm using elite opposition-based learning and adaptive search mechanism for feature selection

Enhanced coati optimization algorithm using elite opposition-based learning and adaptive search mechanism for feature selection

Enhanced coati optimization algorithm using elite opposition-based learning and adaptive search mechanism for feature selection

A hybrid particle swarm optimization algorithm for solving engineering problem

To overcome the disadvantages of premature convergence and easy trapping into local optimum solutions, this paper proposes an improved particle swarm optimization algorithm (named NDWPSO algorithm) based on multiple hybrid strategies. Firstly, the elite opposition-based learning method is utilized to initialize the particle position matrix. Secondly, the dynamic inertial weight parameters are given to improve the global search speed in the early iterative phase. Thirdly, a new local optimal jump-out strategy is proposed to overcome the "premature" problem. Finally, the algorithm applies the spiral shrinkage search strategy from the whale optimization algorithm (WOA) and the Differential Evolution (DE) mutation strategy in the later iteration to accelerate the convergence speed. The NDWPSO is further compared with other 8 well-known nature-inspired algorithms (3 PSO variants and 5 other intelligent algorithms) on 23 benchmark test functions and three practical engineering problems. Simulation results prove that the NDWPSO algorithm obtains better results for all 49 sets of data than the other 3 PSO variants. Compared with 5 other intelligent algorithms, the NDWPSO obtains 69.2%, 84.6%, and 84.6% of the best results for the benchmark function (f1-f13\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${f}_{1}-{f}_{13}$$\\end{document}) with 3 kinds of dimensional spaces (Dim = 30,50,100) and 80% of the best optimal solutions for 10 fixed-multimodal benchmark functions. Also, the best design solutions are obtained by NDWPSO for all 3 classical practical engineering problems.

Symmetry-Enhanced, Improved Pathfinder Algorithm-Based Multi-Strategy Fusion for Engineering Optimization Problems

The pathfinder algorithm (PFA) starts with a random search for the initial population, which is then partitioned into only a pathfinder phase and a follower phase. This approach often results in issues like poor solution accuracy, slow convergence, and susceptibility to local optima in the PFA. To address these challenges, a multi-strategy fusion approach is proposed in the symmetry-enhanced, improved pathfinder algorithm-based multi-strategy fusion for engineering optimization problems (IPFA) for function optimization problems. First, the elite opposition-based learning mechanism is incorporated to improve the population diversity and population quality, to enhance the solution accuracy of the algorithm; second, to enhance the convergence speed of the algorithm, the escape energy factor is embedded into the prey-hunting phase of the GWO and replaces the follower phase in the PFA, which increases the diversity of the algorithm and improves the search efficiency of the algorithm; lastly, to solve the problem of easily falling into the local optimum, the optimal individual position is perturbed using the dimension-by-dimension mutation method of t-distribution, which helps the individual to jump out of the local optimum rapidly and advance toward other regions. The IPFA is used for testing on 16 classical benchmark test functions and 29 complex CEC2017 function sets. The final optimization results of PFA and IPFA in pressure vessels are 5984.8222 and 5948.3597, respectively. The final optimization results in tension springs are 0.012719 and 0.012699, respectively, which are comparable with the original algorithm and other algorithms. A comparison between the original algorithm and other algorithms shows that the IPFA algorithm is significantly enhanced in terms of solution accuracy, and the lower engineering cost further verifies the robustness of the IPFA algorithm.

Ameliorated Snake Optimizer-Based Approximate Merging of Disk Wang-Ball Curves.

A method for the approximate merging of disk Wang-Ball (DWB) curves based on the modified snake optimizer (BEESO) is proposed in this paper to address the problem of difficulties in the merging of DWB curves. By extending the approximate merging problem for traditional curves to disk curves and viewing it as an optimization problem, an approximate merging model is established to minimize the merging error through an error formulation. Considering the complexity of the model built, a BEESO with better convergence accuracy and convergence speed is introduced, which combines the snake optimizer (SO) and three strategies including bi-directional search, evolutionary population dynamics, and elite opposition-based learning. The merging results and merging errors of numerical examples demonstrate that BEESO is effective in solving approximate merging models, and it provides a new method for the compression and transfer of product shape data in Computer-Aided Geometric Design.

NSCSO: a novel multi-objective non-dominated sorting chicken swarm optimization algorithm

Addressing the challenge of efficiently solving multi-objective optimization problems (MOP) and attaining satisfactory optimal solutions has always posed a formidable task. In this paper, based on the chicken swarm optimization algorithm, proposes the non-dominated sorting chicken swarm optimization (NSCSO) algorithm. The proposed approach involves assigning ranks to individuals in the chicken swarm through fast non-dominance sorting and utilizing the crowding distance strategy to sort particles within the same rank. The MOP is tackled based on these two strategies, with the integration of an elite opposition-based learning strategy to facilitate the exploration of optimal solution directions by individual roosters. NSCSO and 6 other excellent algorithms were tested in 15 different benchmark functions for experiments. By comprehensive comparison of the test function results and Friedman test results, the results obtained by using the NSCSO algorithm to solve the MOP problem have better performance. Compares the NSCSO algorithm with other multi-objective optimization algorithms in six different engineering design problems. The results show that NSCSO not only performs well in multi-objective function tests, but also obtains realistic solutions in multi-objective engineering example problems.

EAO: Enhanced aquila optimizer for solving optimization problem

The Aquila optimization (AO) algorithm has the drawbacks of local optimization and poor optimization accuracy when confronted with complex optimization problems. To remedy these drawbacks, this paper proposes an Enhanced aquila optimization (EAO) algorithm. To avoid elite individual from entering the local optima, the elite opposition-based learning strategy is added. To enhance the ability of balancing global exploration and local exploitation, a dynamic boundary strategy is introduced. To elevate the algorithm’s convergence rapidity and precision, an elite retention mechanism is introduced. The effectiveness of EAO is evaluated using CEC2005 benchmark functions and four benchmark images. The experimental results confirm EAO’s viability and efficacy. The statistical results of Freidman test and the Wilcoxon rank sum test are confirmed EAO’s robustness. The proposed EAO algorithm outperforms previous algorithms and can useful for threshold optimization and pressure vessel design.

Solar photovoltaic cell model optimal parameter identification by using an improved chimp optimization algorithm

Identifying the parameters of solar photovoltaic (PV) cell models accurately and reliably is crucial for simulating, evaluating, and controlling PV systems. For this reason, we present an improved chimp optimization algorithm (IChOA) for the generation of precise and reliable solar PV cell models. As a new and improved version of the standard chimp optimization algorithm (ChOA), IChOA embeds two mutation rules in ChOA that include the elite opposition-based learning and visual search mechanism. The first rule is applied to strengthen global exploration capacity of ChOA, and the second one is utilized to enhance ChOA’s local exploitation ability (convergence accuracy). Based on the six benchmark test functions with different characteristics, the effectiveness of IChOA is evaluated by comparing to other five well-known optimization algorithms. The results suggest that IChOA offers superior performance over other competing algorithms. Finally, IChOA’s performance is confirmed through optimizing parameters for three widely employed mathematical models, specifically the single diode model, the double diode model, and the multi-cell PV modules. The findings prove the excellent performance of the suggested approach.

MNEARO: A meta swarm intelligence optimization algorithm for engineering applications

Artificial rabbits (AR) optimization is a newly proposed swarm intelligence algorithm. The idea of AR optimization (ARO) is inspired by the nature behaviors of the AR including the detour foraging, the random hiding and the energy shrink. Although ARO has better performance than many classical natural heuristic algorithms, it still has some disadvantages such as lacking the diversity of the population and easy to trap in the local optimal. To mitigate the influence of the above defects, this paper respectively introduces the mutation strategy, the prey identification strategy and the elite opposition-based learning strategy into the original algorithm, and proposes a new meta swarm intelligence optimization algorithm termed MNEARO. Firstly, the mutation strategy is introduced into the two natural behaviors of ARO to expand its exploration range in the solution space and increase the probability of finding the global optimal. Secondly, replacing the captured individuals with the predators that take better action trajectories to achieve the population evolution. Another candidate population is generated by the prey identification strategy, thus improving the population diversity and dynamics of ARO. Finally, the elite opposition-based learning strategy improves the exploitation ability of ARO and the overall quality of the population by selecting some individuals with the better fitness values as the elites and using the greedy selection before the end of each iteration. A series of performance tests are conducted on the CEC2020 test set in four dimensions and the CEC2022 test set in the highest dimension respectively to verify that the proposed MNEARO has better convergence and robustness. In addition, the practicality of MNEARO is further highlighted through five mechanical optimization designs, two truss topology optimization designs and the vehicle cruise control system. The experimental results show that the proposed MNEARO has a strong competitiveness in solving complex optimization problems with different dimensions.

A Novel Balanced Arithmetic Optimization Algorithm-Optimized Controller for Enhanced Voltage Regulation

This work introduces an innovative approach that unites a PIDND2N2 controller and the balanced arithmetic optimization algorithm (b-AOA) to enhance the stability of an automatic voltage regulator (AVR) system. The PIDND2N2 controller, tailored for precision, stability, and responsiveness, mitigates the limitations of conventional methods. The b-AOA optimizer is obtained through the integration of pattern search and elite opposition-based learning strategies into the arithmetic optimization algorithm. This integration optimizes the controller parameters and the AVR system’s response, harmonizing exploration and exploitation. Extensive assessments, including evaluations on 23 classical benchmark functions, demonstrate the efficacy of the b-AOA. It consistently achieves accurate solutions, exhibits robustness in addressing a wide range of optimization problems, and stands out as a promising choice for various applications. In terms of the AVR system, comparative analyses highlight the superiority of the proposed approach in transient response characteristics, with the shortest rise and settling times and zero overshoot. Additionally, the b-AOA approach excels in frequency response, ensuring robust stability and a broader bandwidth. Furthermore, the proposed approach is compared with various state-of-the-art control methods for the AVR system, showcasing an impressive performance. These results underscore the significance of this work, setting a new benchmark for AVR control by advancing stability, responsiveness, and reliability in power systems.

Material stiffness optimization for homogenizing contact stress distribution based on particle swarm optimization using elite opposition-based learning mutation

Rapid advances in computer science and material science have made intelligent algorithms promising for solving material design problems. Particle swarm optimization (PSO) algorithm, as a typical swarm intelligence algorithm, is utilized in this paper as the tool to solve the problem of material stiffness optimization for homogenizing the contact stress distribution. In order to achieve an effective and efficient solution, the opposition-based learning (OBL) technique is introduced and combined with PSO to increases its exploration ability. Two mutation strategies, namely, dimension-by-dimension opposition-based learning and multi-dimensional random opposition-based learning mutation strategies, are further proposed to increase the population diversity of PSO. On this basis, algorithms named DEOBL-PSO and MREOBL-PSO are developed. The developed DEOBL-PSO and MREOBL-PSO are then applied to the field of nonlinear contact in engineering, and the specific problem of material stiffness optimization for homogenizing the contact stress distribution is solved. Impressive results are obtained. The contact stress distributing uniformity is substantially improved by material stiffness optimization using DEOBL-PSO and MREOBL-PSO. Additionally, new relation between material stiffness distribution and contact stress distribution is observed, and the effect of the material stiffness variation range on the contact stress distribution is further explored.