Opposition-based Learning Research Articles

An effective feature selection approach based on hybrid Grey Wolf Optimizer and Genetic Algorithm for hyperspectral image

Feature selection (FS) is a critical step in hyperspectral image (HSI) classification, essential for reducing data dimensionality while preserving classification accuracy. However, FS for HSIs remains an NP-hard challenge, as existing swarm intelligence and evolutionary algorithms (SIEAs) often suffer from limited exploration capabilities or susceptibility to local optima, particularly in high-dimensional scenarios. To address these challenges, we propose GWOGA, a novel hybrid algorithm that combines Grey Wolf Optimizer (GWO) and Genetic Algorithm (GA), aiming to achieve an effective balance between exploration and exploitation. The innovation of GWOGA lies in three core strategies: (1) chaotic map and Opposition-Based Learning (OBL) for uniformly distributed population initialization, enhancing diversity and mitigating premature convergence; (2) elite learning strategy to prioritize high-ranking solutions, strengthening the search hierarchy and efficiency; and (3) a hybrid optimization mechanism where GWO ensures rapid early-stage convergence, while GA refines global search in later stages to escape local optima. Experiments on three benchmark HSIs (i.e., Indian Pines, KSC, and Botswana) demonstrate that GWOGA outperforms state-of-the-art algorithms, achieving higher classification accuracy with fewer selected bands. The results highlight GWOGA’s robustness, generalizability, and potential for real-world applications in HSI FS.

An Improved Aquila Optimizer with Local Escaping Operator and Its Application in UAV Path Planning

Background: With the development of intelligent technology, Unmanned aerial vehicles (UAVs) are widely used in military and civilian fields. Path planning is the most important part of UAV navigation system. Its purpose is to find a smooth and feasible path from the start to the end. Objective: In order to obtain a better flight path, this paper presents an improved Aquila optimizer combing the opposition-based learning and the local escaping operator, named LEOAO, to deal with the UAV path planning problem in three-dimensional environments. Methods: UAV path planning is modelled as a constrained optimization problem in which the cost function consists of one objective: path length and four constraints: safe distance, flight height, turning angle and climbing/diving angle. In this paper, the LEOAO is introduced to find the optimal path by minimizing the cost function, and B-Spline is invited to represent a smooth path. The local escaping operator is used to enhance the search ability of the algorithm. Results: To test the performance of LEOAO, two scenarios are applied based on basic terrain function. Experiments show that the proposed LEOAO outperforms other algorithms such as the grey wolf optimizer, whale optimization algorithm, including the original Aquila optimizer. Conclusion: The proposed algorithm combines the opposition-based learning and local escaping operator. The opposition-based learning algorithm has the ability to accelerate convergence. And the introduction of LEO effectively balances the exploration and exploitation abilities of the algorithm and improves the quality of the population. Finally, the improved Aquila optimizer obtains a better path.

Quasi Opposition-based Learning in Beluga Whale Optimization Feature Selection Approach for Diabetes Prediction in IoT System

Quasi Opposition-based Learning in Beluga Whale Optimization Feature Selection Approach for Diabetes Prediction in IoT System

Non-destructive detection of milk nutritional components based on hyperspectral imaging.

As consumers increasingly prioritize food safety and nutritional value, the dairy industry faces a pressing need for rapid and accurate methods to detect essential nutritional components in milk, such as fat, protein, and lactose. Hyperspectral imaging (HSI) technology, known for its non-destructive, fast, and precise nature, shows great promise in food quality assessment. However, the high dimensionality of HSI data poses challenges for effective band selection and model optimization. Additionally, prior studies primarily focus on predicting single nutritional components without addressing simultaneous multi-component detection. To overcome these challenges, this study presents a comprehensive approach that integrates moving average smoothing and first derivative (MA-FD) preprocessing, the improved coati optimization algorithm (ICOA), and the CatBoost model for multi-target regression. ICOA incorporates the good point set strategy, dynamic opposition-based learning, and the golden sine algorithm, which significantly enhance its global search capability and convergence speed in band selection. Combined with CatBoost's multi-target prediction capability, this method enables accurate detection of fat, protein, and lactose levels in milk. Experimental results demonstrate high prediction accuracy, with the calibration set achieving an multi-target coefficient of determination (MultiR2) of 0.9992 and multi-target root mean square error (MultiRMSE) of 0.0240, while the prediction set yielded an MultiR2 of 0.9797 and MultiRMSE of 0.1181. Prediction set R2 values for fat, protein, and lactose were 0.9658, 0.9910, and 0.9825, respectively. The proposed method demonstrates robust predictive accuracy and reliability in milk quality assessment, and its potential for application in broader food quality assessments is substantial. PRACTICAL APPLICATION: This study provides a rapid, non-destructive method for assessing milk quality by detecting key nutritional components through hyperspectral imaging, combined with MA-FD preprocessing, ICOA for band selection, and CatBoost for multi-target regression. This approach offers the dairy industry a reliable, non-invasive solution that supports quality control and helps safeguard consumer health.

Chamber shape optimization for ultra-high-pressure water-jet nozzle based on computational fluid dynamics method and a data-driven surrogate model

The ultra-high-pressure (UHP) water-jet nozzle acts as one of the key units for the whole rotary sprayers, and its chamber shape plays a decisive role in improving the hydrodynamic performance of water jetting. Unfortunately, comprehensive and effective methods to optimize the nozzles’ chamber shape are still lacking. By coupling a data-driven surrogate model with metaheuristic optimizer, a computational fluid dynamics (CFD)-based optimization scheme aiming at fully enhancing the hydrodynamic performance of UHP nozzles was proposed in this paper. Firstly, to ensure optimization accuracy, an improved whale optimization algorithm (IWOA) was developed. It combines the chaotic opposition-based learning (COBL) and the Cauchy-Gaussian mutation simulated annealing algorithms, incorporating a nonlinear convergence and adaptive inertia weight mechanism. Then, to reduce CFD computational costs and accelerate calculation speed, a data-driven surrogate model based on IWOA-support vector machine (SVM) was proposed. Herein, the parameter gamma and the penalty coefficient in SVM model, are trained using IWOA. The IWOA-SVM model was constructed using optimal Latin hypercube design (Opt. LHD) to sample nozzle structures, with peak wall shear stress (as objective function) calculated via CFD method. Finally, this optimization scheme was applied to optimize the chamber shape of the original nozzle commonly used in ship rust removal. The results reveal that the chamber shape of the optimized nozzle can greatly enhance the water-jet hydrodynamic performance by raising the peak wall shear stress by 13.88%. Additionally, the IWOA-SVM model demonstrates the capability to evaluate hydrodynamic performance with a maximum error of 2.853%. Therefore, the proposed optimization scheme provides novel insights for the overall design and optimization of the UHP water-jet nozzle.

An Improved Spider Wasp Optimizer for UAV Three-Dimensional Path Planning.

This paper proposes an Improved Spider Wasp Optimizer (ISWO) to address inaccuracies in calculating the population (N) during iterations of the SWO algorithm. By innovating the population iteration formula and integrating the advantages of Differential Evolution and the Crayfish Optimization Algorithm, along with introducing an opposition-based learning strategy, ISWO accelerates convergence. The adaptive parameters trade-off probability (TR) and crossover probability (Cr) are dynamically updated to balance the exploration and exploitation phases. In each generation, ISWO optimizes individual positions using Lévy flights, DE's mutation, and crossover operations, and COA's adaptive update mechanisms. The OBL strategy is applied every 10 generations to enhance population diversity. As the iterations progress, the population size gradually decreases, ultimately yielding the optimal solution and recording the convergence process. The algorithm's performance is tested using the 2017 test set, modeling a mountainous environment with a Gaussian function model. Under constraint conditions, the objective function is updated to establish a mathematical model for UAV flight. The minimal cost for obstacle-avoiding flight within the specified airspace is obtained using the fitness function, and the flight path is smoothed through cubic spline interpolation. Overall, ISWO generates high-quality, smooth paths with fewer iterations, overcoming premature convergence and the insufficient local search capabilities of traditional genetic algorithms, adapting to complex terrains, and providing an efficient and reliable solution.

Multi-Class Sunflower Disease Detection by Integrating Enhanced Jellyfish Search Algorithm

Objectives: This research aims to classify diseases observed in sunflower flowers and leaves using deep learning algorithms. The goal is to enhance agricultural output by addressing the significant issue of plant diseases, which negatively affect the security of the food supply. Methods: The study utilizes a feature selection approach to identify multi-class sunflower diseases. The Enhanced Jellyfish Search (EJFSOA) algorithm is improved in three ways: (i) optimization capabilities and convergence speed are enhanced through sine and cosine learning variables during Type B motion in the swarm, (ii) a local escape operator is added to avoid the local optimization trap, improving the exploitability of the JS algorithm, and (iii) opposition-based learning and quasi-opposition learning strengthen the population distribution. A deep learning model, Multi-class Sunflower Network (MCSFNet), combines ResNets with TensorFlow for feature extraction, multi-label classification, and a multi-spectral stacking module. Findings: The proposed model is evaluated using several criteria, including accuracy, sensitivity, specificity, and F1-score. On a publicly available dataset, the algorithm achieves an average accuracy of 99.56%, outperforming state-of-the-art approaches with accuracies of 98.34% and 97.39%. Novelty: This work introduces improvements to the EJFSOA algorithm, significantly enhancing the precision and convergence speed of sunflower disease classification models. Combining deep learning with an optimized feature selection method leads to superior results in multi-class classification tasks. Keywords: Sunflower Leaves, Disease Detection, Enhanced jellyfish search, Local escape operator, Multi­class Sunflower Network, Residual Networks

Defect detection in hot stamping process printed matter by beluga optimized support vector machine with opposition-based learning

Defect detection in hot stamping process printed matter by beluga optimized support vector machine with opposition-based learning

High-fidelity prediction of forming quality for self-piercing riveted joints in aluminum alloy based on machine learning

The effect of rivet length and sheet thickness on the cross-sectional formation and tensile-shear performance of self-piercing riveted joints in AA5754 aluminum alloy was examined through experimental investigation. The influence degree of joining parameters on the forming quality was analyzed. It was revealed that rivet length and sheet thickness are pivotal factors influencing the tensile-shear strength of the joint, culminating in the identification of four optimal riveting process schemes:LCh1Ah2A、LAh1Ah2B、LAh1Ah2B and LBh1Ah2B. A simulation model for self-piercing riveting was established, employing the GISSMO failure model and the modified Mohr-Coulomb (MMC) failure criteria to predict the damage and fracture of the aluminum alloy. A plethora of high-quality datasets depicting the cross-sections of the joints were derived from simulation analysis. Subsequently, the structure and hyperparameter determination method of traditional neural network prediction models were elucidated. By amalgamating the Aquila Optimization (AO) algorithm with the African Vultures Optimization Algorithm (AVOA), a hybrid optimization algorithm model known as MIC_AOAVOA was developed. This model effectively harnesses the strengths of various algorithms to augment search efficiency and optimization capabilities. Strategies for population initialization and adaptive weight adjustments were incorporated to enhance the algorithm's convergence velocity and the quality of solutions. The cauchy opposition-based learning (COBL) and fitness-distance balance (FDB) strategy further refined the composite algorithm, bolstering its global search capabilities and population diversity. Comparative analyses were performed with single algorithm models and traditional BP neural network models, with an in-depth examination of the MIC_AOAVOA_BP model's prediction outcomes. Comprehensive evaluations utilizing error statistics and composite evaluation indicators demonstrated that the model consistently achieved mean absolute percentage error (MAPE) values below 10%, correlation coefficients (R²) exceeding 0.98, and stable mean squared error (MSE) values around 0.0002 across the prediction of three metrics. These results underscore the model's high precision and stability. Consequently, the proposed enhanced model offers a solution that is more stable, accurate, and robust for the prediction of forming quality in self-piercing riveted joints within engineering applications.

Modulation optimization method for seven-level SHEPWM inverter based on EPSO algorithm

Selective Harmonic Elimination Pulse Width Modulation (SHEPWM) has excellent harmonic characteristics, but its nonlinear transcendental system of equations is difficult to be solved, and the practical application encounters a bottleneck. In this paper, a modulation optimization method for seven-level SHEPWM inverter based on the Evolutionary Particle Swarm Optimization (EPSO) algorithm is proposed to address this problem, so that the algorithm quickly converges to the global optimum solution. The EPSO algorithm incorporates a population optimization strategy in two phases to improve the population diversity in real time. In the initialization phase, the initialized population is optimized using Opposition-Based Learning (OBL) to improve the quality of the initial population. In the iterative stage, we combine the adaptive Particle Swarm Optimization (PSO) algorithm, Tunicate Swarm Algorithm (TSA), Adaptive Gaussian Variation, Quasi-Opposition-Based Learning (QOBL) and other optimization methods to solve the problem of insufficient population diversity in the process of searching for the optimal solution, to break through the local optimum, and to improve the convergence speed and accuracy of the algorithm. Experiments of the algorithm in 19 benchmark functions and seven-level SHEPWM inverter optimization modulation show that the optimization ability of the EPSO algorithm is ahead of TSA, INFO, MA (Mayfly Algorithm), EO (Equilibrium Optimizer) and other optimization algorithms. The solution speed is about three times that of PSO, which achieves fast and highly accurate convergence, with a small error in the output of inverter, and better harmonic distortion rate than the standard requirement.

A Hyper-Parameter Optimizer Algorithm Based on Conditional Opposition Local-Based Learning Forbidden Redundant Indexes Adaptive Artificial Bee Colony Applied to Regularized Extreme Learning Machine

Finding the best configuration of a neural network’s hyper-parameters may take too long to be feasible using an exhaustive search, especially when the cardinality of the search space has a big combinatorial number of possible solutions with various hyper-parameters. This problem is aggravated when we also need to optimize the parameters of the neural network, such as the weight of the hidden neurons and biases. Extreme learning machines (ELMs) are part of the random weights neural network family, in which parameters are randomly initialized, and the solution, unlike gradient-descent-based algorithms, can be found analytically. This ability is especially useful for metaheuristic analysis due to its reduced training times allowing a faster optimization process, but the problem of finding the best hyper-parameter configuration is still remaining. In this paper, we propose a modification of the artificial bee colony (ABC) metaheuristic to act as parameterizers for a regularized ELM, incorporating three methods: an adaptive mechanism for ABC to balance exploration (global search) and exploitation (local search), an adaptation of the opposition-based learning technique called opposition local-based learning (OLBL) to strengthen exploitation, and a record of access to the search space called forbidden redundant indexes (FRI) that allow us to avoid redundant calculations and track the explored percentage of the search space. We set ten parameterizations applying different combinations of the proposed methods, limiting them to explore up to approximately 10% of the search space, with results over 98% compared to the maximum performance obtained in the exhaustive search in binary and multiclass datasets. The results demonstrate a promising use of these parameterizations to optimize the hyper-parameters of the R-ELM in datasets with different characteristics in cases where computational efficiency is required, with the possibility of extending its use to other problems with similar characteristics with minor modifications, such as the parameterization of support vector machines, digital image filters, and other neural networks, among others.

A novel adaptive optimization scheme for advancing metaheuristics and global optimization

Metaheuristics have been the dominant approach for tackling complex optimization challenges across diverse disciplines. Numerous studies have sought to enhance the performance of existing metaheuristics by identifying their limitations and modifying their frameworks. Despite these efforts, many resulting strategies remain overly complex, often narrowly focused on a single algorithm and a specific problem domain. In this study, we introduce a novel adaptive optimization scheme (AOS) designed as an algorithm-independent mechanism for enhancing the performance of metaheuristics by addressing various optimization challenges. This scheme is developed through a comprehensive integration of three substructures, each aimed at mitigating common deficiencies in metaheuristics across three optimization pillars: high exploration capabilities, effective avoidance of local optima, and strong exploitation capabilities. Three prominent approaches—Lévy Flights, Chaotic Local Search, and Opposition-based Learning—are skillfully combined to overcome these shortcomings in various metaheuristic algorithms, establishing a straightforward unit. Through rigorous testing on 50 diverse mathematical benchmark functions, we assessed the performance of original metaheuristics and their AOS-upgraded versions. The results confirm that the proposed AOS consistently elevates algorithmic effectiveness across multiple optimization metrics. Notably, four AOS-upgraded algorithms—EO-AOS, HBA-AOS, DBO-AOS, and PSO-AOS—emerge as the leading performers among the 16 algorithms under evaluation. Comparisons between the upgraded and baseline metaheuristics further reveal the substantial impact of AOS, as each upgraded variant demonstrably surpasses its original algorithm in various optimization capabilities.

Research on Microgrid Optimal Scheduling Based on an Improved Honey Badger Algorithm

As global energy demands continue to grow and environmental protection pressures increase, microgrids have garnered widespread attention due to their ability to effectively integrate distributed energy sources, improve energy utilization efficiency, and enhance grid stability. Due to the complexity of internal structure, variety of energy sources, and uncertainty of load demand, the optimal scheduling problem of microgrids becomes extremely complicated. Traditional optimization methods often perform poorly in complex and dynamic microgrid environments, and it is assumed that the complexity is low or that more simplification is needed, which leads to poor convergence and local optimality when dealing with uncertainty and nonlinear problems, making intelligent optimization algorithms a crucial solution to this problem. To address the shortcomings of the traditional honey badger algorithm, such as the slow convergence speed and a tendency to fall into local optima in complex microgrid optimal scheduling problems, this paper proposes a multi-strategy improved honey badger algorithm. During the population initialization phase, a combined opposition-based learning strategy is introduced to enhance the algorithm’s exploration and exploitation capabilities. Additionally, the introduction of variable spiral factors and a linearly decreasing strategy for parameters improves the overall efficiency of the algorithm and reduces the risk of local optima. To further enhance population diversity, a hunger search strategy is employed, providing stronger adaptability and global search capabilities in varying environments. The improved honey badger algorithm is then applied to solve the multi-objective optimal scheduling problem in grid-connected microgrid modes. The simulation results indicate that the improved honey badger algorithm effectively enhances the economic and environmental benefits of microgrid operations, improving system operational stability.

A reliability calculation method based on ISSA-BP neural network

PurposeTo address the shortcomings of the traditional back propagation (BP) neural network agent model, such as insufficient fitting accuracy and low computational efficiency, an improved method is proposed.Design/methodology/approachIn this study, an improved sparrow search algorithm (ISSA) is developed to optimize the reliability calculation of the BP neural network (ISSA-BP) using an enhanced BP neural network model. The traditional sparrow search algorithm is enhanced by incorporating a golden sine strategy to improve its position-updating mechanism, thereby overcoming its tendency to converge prematurely to local optima. Additionally, an opposition-based learning strategy is integrated to explore the reverse solution around the optimal solution of the sparrow search algorithm, mitigating the risk of local optima.FindingsThe results of the test function demonstrate that the proposed method significantly enhances fitting accuracy while maintaining computational efficiency. Finally, by applying this approach to the metro bogie frame as a case study, the structural reliability of the bogie frame is evaluated using the Monte Carlo method, providing valuable insights for subsequent analysis and structural optimization.Originality/valueThe use of the surrogate model approach for structural reliability analysis significantly improves solution efficiency. Furthermore, the integration of ISSA with the BP neural network enhances both fitting accuracy and computational efficiency, demonstrating the superiority and practicality of the proposed method.

Opposition-based learning Harris hawks optimization with steepest convergence for engineering design problems

Opposition-based learning Harris hawks optimization with steepest convergence for engineering design problems

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.

Ensembled snake optimiser to solve multiobjective mixed energy generation scheduling

This paper presents Ensembled Snake Optimiser (ESO), to optimise the scheduling of mixed energy generation from coordinated thermal, hydro, pumped-storage hydro, and solar units. It tackles operational constraints while minimising non-convex and non-linear objectives. To reduce the pollutants emitted and operating cost of thermal and solar units, the mixed energy generation scheduling problem uses committed hydro, thermal, and solar units to generate power, pumped-storage hydro units to maintain water levels, and hydro units to maximise available water volume. Utilising the water volume and actively exceeding the power-generating limit are the primary obstacles to satisfy the load requirement. The heuristics are utilised to satisfy the load demand and water volume constraints. The binary-optimistic approach commits solar units. The snake optimisation algorithm tends to get trapped in the local minima while solving complex engineering optimisation problems, which leads to sluggish convergence behaviour. A local search, simplex search, and extended opposition-based learning are investigated to improve its exploitation aspect, convergence behaviour, and procure good solutions. Three electric power systems are undertaken for the simulation studies. ESO gives better results. The significant cost savings for integrated energy scheduling are ranging from 10–15%. The rapid convergence behaviour and whisker box plots justify ESO’s robustness.

Dynamic step opposition-based learning sparrow search algorithm for UAV path planning

In this paper, aiming at the problems of large randomness, low convergence accuracy, and easy falling into local optimum in the application of sparrow search algorithm to UAV three-dimensional path planning, a dynamic step opposition-based learning sparrow search algorithm is proposed. The algorithm first uses a good point set in the population initialization phase to improve the quality of the initial solution; secondly, the piecewise dynamic step size is used to optimize the update formula of the discoverer, and the extensive search is carried out in the early stage of the iteration. In the later stage, the known area is mined as much as possible to improve the search accuracy and convergence speed of the algorithm. Then, the crazy operator is integrated to optimize the predator update formula and improve the local search ability. Finally, t-distribution opposition-based learning is used to prevent the algorithm from falling into the local optimum. In this paper, the effectiveness of the improved algorithm is verified by six test functions and applied to the three-dimensional path planning of UAVs. The experimental results show that the proposed algorithm has a faster convergence speed than the traditional algorithm, and the planned path is shorter.

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.

Power Transformer Fault Diagnosis Based on Random Forest and Improved Particle Swarm Optimization–Backpropagation–AdaBoost

This paper proposes a novel fault diagnosis methodology for oil-immersed transformers to improve the diagnostic accuracy influenced by gas components in power transformer oil. Firstly, the Random Forest (RF) algorithm is utilized to evaluate and filter the raw data features, solving the problem of determining significant features in the dataset. Secondly, a multi-strategy Improved Particle Swarm Optimization (IPSO) is applied to optimize a double-hidden layer backpropagation neural network (BPNN), which overcomes the challenge of determining hyperparameters in the model. Four enhancement strategies, including SPM chaos mapping based on opposition-based learning, adaptive weight, spiral flight search, and crisscross strategies, are introduced based on traditional Particle Swarm Optimization (PSO) to enhance the model’s optimization capabilities. Lastly, AdaBoost is integrated to fortify the resilience of the IPSO-BP network. Ablation experiments demonstrate an enhanced convergence rate and model accuracy of IPSO. Case analysis using Dissolved Gas Analysis (DGA) samples compares the proposed IPSO–BP–AdaBoost model with other swarm intelligence optimization algorithms integrated with BPNN. The experimental findings highlight the superior diagnostic accuracy and classification performance of the IPSO–BP–AdaBoost model.