Traditional Particle Swarm Optimization Research Articles

Differential Privacy-Preserving IoT Data Sharing Through Enhanced PSO

ABSTRACT With the proliferation of Internet of Things (IoT) devices and the generation of massive amounts of sensitive data, preserving privacy while enabling data sharing has become a critical concern. In this research, we propose a novel approach for achieving differential privacy in IoT data sharing through an improved Particle Swarm Optimization (PSO) algorithm. Our objective is to find the optimal configuration of privacy-preserving mechanisms that maximizes privacy while maintaining data utility. The research begins with a comprehensive overview of differential privacy in IoT data sharing, highlighting the limitations of existing optimization algorithms. We then present our proposed improvements to the traditional PSO algorithm, including the design of a suitable fitness function, the use of a dynamic inertia weight, exploration of different neighborhood topologies, and adaptive acceleration coefficients. We define a set of performance metrics, including privacy metrics (e.g. ε-differential privacy parameter) and utility measures (e.g. accuracy, utility loss), to assess the algorithm’s effectiveness. The results of our experiments demonstrate that the improved PSO algorithm achieves higher privacy guarantees while maintaining competitive levels of data utility compared to existing approaches. The proposed algorithm exhibits faster convergence, better exploration of the search space, and improved scalability. Our research contributes to the field of privacy-preserving IoT data sharing by providing an efficient and effective optimization algorithm that enables secure and privacy-aware data sharing while facilitating valuable insights and analysis.

An Enhanced Multiple Unmanned Aerial Vehicle Swarm Formation Control Using a Novel Fractional Swarming Strategy Approach

This paper addresses the enhancement of multiple Unmanned Aerial Vehicle (UAV) swarm formation control in challenging terrains through the novel fractional memetic computing approach known as fractional-order velocity-pausing particle swarm optimization (FO-VPPSO). Existing particle swarm optimization (PSO) algorithms often suffer from premature convergence and an imbalanced exploration–exploitation trade-off, which limits their effectiveness in complex optimization problems such as UAV swarm control in rugged terrains. To overcome these limitations, FO-VPPSO introduces an adaptive fractional order β and a velocity pausing mechanism, which collectively enhance the algorithm’s adaptability and robustness. This study leverages the advantages of a meta-heuristic computing approach; specifically, fractional-order velocity-pausing particle swarm optimization is utilized to optimize the flying path length, mitigate the mountain terrain costs, and prevent collisions within the UAV swarm. Leveraging fractional-order dynamics, the proposed hybrid algorithm exhibits accelerated convergence rates and improved solution optimality compared to traditional PSO methods. The methodology involves integrating terrain considerations and diverse UAV control parameters. Simulations under varying conditions, including complex terrains and dynamic threats, substantiate the effectiveness of the approach, resulting in superior fitness functions for multi-UAV swarms. To validate the performance and efficiency of the proposed optimizer, it was also applied to 13 benchmark functions, including uni- and multimodal functions in terms of the mean average fitness value over 100 independent trials, and furthermore, an improvement at percentages of 29.05% and 2.26% is also obtained against PSO and VPPSO in the case of the minimum flight length, as well as 16.46% and 1.60% in mountain terrain costs and 55.88% and 31.63% in collision avoidance. This study contributes valuable insights to the optimization challenges in UAV swarm-formation control, particularly in demanding terrains. The FO-VPPSO algorithm showcases potential advancements in swarm intelligence for real-world applications.

Optimized FOPID controller for nuclear research reactor using enhanced planet optimization algorithm

Nuclear reactor control is pivotal for the safe and efficient operation of nuclear power plants, facilitating the regulation of reactor reactivity. This study introduces an optimized fractional-order proportional-integral-derivative (FOPID) controller tailored for maintaining reactivity levels in nuclear power plants, particularly during load-following operations. The controller adjusts the position of control rod to regulate power output effectively. We enhance FOPID controller's performance using a modification of Planet Optimization Algorithm (POA-M), leveraging the strengths of the Arithmetic Optimization Algorithm (AOA) to improve its exploitation capabilities. We evaluate the efficacy of POA-M-FOPID controller against traditional techniques, including POA, AOA, and Particle Swarm Optimization (PSO). We assess its performance using the Egyptian Testing Research Reactor (ETRR-2) as a case study. Our results demonstrate that the POA-M-FOPID controller outperforms alternative algorithms across various control metrics, exhibiting superior resilience and efficiency. Notably, the utilization of the POA-M-FOPID controller yields remarkable improvements in reactor power performance, achieving significantly reduced settling time (25.27 sec) and maximum overshoot (0.67 %) compared to conventional FOPID controllers incorporating POA, AOA, and PSO methods. These findings underscore the effectiveness of POA-M-FOPID in enhancing nuclear reactor control systems, offering potential benefits for broader nuclear power industry in terms of safety, stability, and operational efficiency.

Particle Swarm Optimization Algorithm Using Velocity Pausing and Adaptive Strategy

Particle swarm optimization (PSO) as a swarm intelligence-based optimization algorithm has been widely applied to solve various real-world optimization problems. However, traditional PSO algorithms encounter issues such as premature convergence and an imbalance between global exploration and local exploitation capabilities when dealing with complex optimization tasks. To address these shortcomings, an enhanced PSO algorithm incorporating velocity pausing and adaptive strategies is proposed. By leveraging the search characteristics of velocity pausing and the terminal replacement mechanism, the problem of premature convergence inherent in standard PSO algorithms is mitigated. The algorithm further refines and controls the search space of the particle swarm through time-varying inertia coefficients, symmetric cooperative swarms concepts, and adaptive strategies, balancing global search and local exploitation. The performance of VASPSO was validated on 29 standard functions from Cec2017, comparing it against five PSO variants and seven swarm intelligence algorithms. Experimental results demonstrate that VASPSO exhibits considerable competitiveness when compared with 12 algorithms. The relevant code can be found on our project homepage.

Design of health information management model for elderly care using an advanced higher-order hybrid clustering algorithm from the perspective of sports and medicine integration.

In the context of integrating sports and medicine domains, the urgent resolution of elderly health supervision requires effective data clustering algorithms. This paper introduces a novel higher-order hybrid clustering algorithm that combines density values and the particle swarm optimization (PSO) algorithm. Initially, the traditional PSO algorithm is enhanced by integrating the Global Evolution Dynamic Model (GEDM) into the Distribution Estimation Algorithm (EDA), constructing a weighted covariance matrix-based GEDM. This adapted PSO algorithm dynamically selects between the Global Evolution Dynamic Model and the standard PSO algorithm to update population information, significantly enhancing convergence speed while mitigating the risk of local optima entrapment. Subsequently, the higher-order hybrid clustering algorithm is formulated based on the density value and the refined PSO algorithm. The PSO clustering algorithm is adopted in the initial clustering phase, culminating in class clusters after a finite number of iterations. These clusters then undergo the application of the density peak search algorithm to identify candidate centroids. The final centroids are determined through a fusion of the initial class clusters and the identified candidate centroids. Results showcase remarkable improvements: achieving 99.13%, 82.22%, and 99.22% for F-measure, recall, and precision on dataset S1, and 75.22%, 64.0%, and 64.4% on dataset CMC. Notably, the proposed algorithm yields a 75.22%, 64.4%, and 64.6% rate on dataset S, significantly surpassing the comparative schemes' performance. Moreover, employing the text vector representation of the LDA topic vector model underscores the efficacy of the higher-order hybrid clustering algorithm in efficiently clustering text information. This innovative approach facilitates swift and accurate clustering of elderly health data from the perspective of sports and medicine integration. It enables the identification of patterns and regularities within the data, facilitating the formulation of personalized health management strategies and addressing latent health concerns among the elderly population.

Temperature compensation model for non-dispersive infrared CO2 gas sensor based on WOA-BP algorithm

Temperature compensation is the main measure to solve the problem that the detection accuracy of non-dispersive infrared CO2 gas sensor is affected by temperature. As the measurement accuracy of the non-dispersive infrared CO2 gas sensor is easily affected by the ambient temperature, this article analyzes the reasons why the sensor is affected by temperature, and proposes a temperature compensation method that integrates the Whale Algorithm (WOA) and BP neural network. The whale algorithm is used to optimize the weights and thresholds of the BP neural network to build a temperature compensation model for the non-dispersive infrared CO2 gas sensor and compare the superiority with the traditional BP neural network model and particle swarm optimization (PSO) BP neural network model. The experimental results show that the temperature compensation model error of WOA-BP algorithm is lower than 30 ppm, and the average absolute error percentage is 3.86%, which is far better than BP neural network and PSO-BP neural network, and effectively reduces the influence of temperature on the accuracy of the sensor.

Multi-scene application of intelligent inspection robot based on computer vision in power plant

As industries develop, the automation and intelligence level of power plants is constantly improving, and the application of patrol robots is also increasingly widespread. This research combines computer vision technology and particle swarm optimization algorithm to build an obstacle recognition model and obstacle avoidance model of an intelligent patrol robot in a power plant respectively. Firstly, the traditional convolutional recurrent neural network is optimized, and the obstacle recognition model of an intelligent patrol robot is built by combining the connection timing classification algorithm. Then, the artificial potential field method optimizes the traditional particle swarm optimization algorithm, and an obstacle avoidance model of an intelligent patrol robot is built. The performance of the two models was tested, and it was found that the highest precision, recall, and F1 values of the identification model were 0.978, 0.974, and 0.975. The highest precision, recall, and F1 values of the obstacle avoidance model were 0.97, 0.96, and 0.96 respectively. The two optimization models designed in this research have better performance. In conclusion, the two models in this study are superior to the traditional methods in recognition effect and obstacle avoidance efficiency, providing an effective technical scheme for intelligent patrol inspection of power plants.

Impact of Under Voltage Load Shedding Approach for Voltage Security Control in Power Quality Environment

Contingencies in power system are an ever-present problem for electrical engineers. They may cause the system to have low voltages due to active and reactive power deficiencies. Engineers shold consider the many solutions to approach this problem. The solution has to be appropriate to the contingency faced so as to be able to solve the issue without major damage to a power system. A drastic measure that can be used is by removing low voltage loads or ‘shedding’ the problematic loads. This method of Under Voltage Load Shedding is done by shedding or ‘islanding’ buses that have fallen to a predetermined minimum voltage for a predetermined time to prevent a cascade of blackouts in the widespread power system. The method to automate the process is by using two optimization techniques, Evolutionary Programming (EP) and Particle Swarm Optimization (PSO). This paper proposes a new hybrid algorithm, named Integrated Chaotic Swarm Based-Evolutionary Programming Optimization (ICSBEP) Technique for Voltage Security Control using Under Voltage Load Shedding (UVLS) approach. Voltage security is indicated by the reduction in voltage stability index, FVSI. In this study, EP, PSO and ICSBEP optimizations algorithms were developed and tested on a IEEE 30-bus reliability test system (RTS). Comparative studies were conducted to observe the advantages of the hybrid algorithm over traditional EP and PSO algorithms. The results obtained from the study can help manage the power quality of the system in ensuring that the customer receive secure electricity supply.

Adaptive Reactive Power Optimization in Offshore Wind Farms Based on an Improved Particle Swarm Algorithm

To address the reactive power optimization control problem in offshore wind farms (OWFs), this paper proposes an adaptive reactive power optimization control strategy based on an improved Particle Swarm Optimization (PSO) algorithm. Firstly, an OWF multi-objective optimization control model is established, with the total sum of voltage deviations at wind turbine (WT) terminals, active power network losses, and reactive power margin of WTs as comprehensive optimization objectives. Innovatively, adaptive weighting coefficients are introduced for the three sub-objectives, enabling the weights of each optimization objective to be adaptively adjusted based on real-time operating conditions, thus enhancing the adaptability of the reactive power optimization model to changes in operating conditions. Secondly, a Uniform Adaptive Particle Swarm Optimization (UAPSO) algorithm is proposed. On one hand, the algorithm initializes the particle swarm using a uniform initialization method; on the other hand, it improves the particle velocity update formula, allowing the inertia coefficient to adaptively adjust based on the number of iterations and the fitness ranking of particles. Simulation results demonstrate the following: (1) Under various operating conditions, the proposed adaptive multi-objective reactive power optimization strategy can ensure the stability of node voltages in offshore wind farms, reduce active power losses, and simultaneously improve reactive power margins. (2) Compared with the traditional PSO algorithm, UAPSO exhibits an approximately 10% improvement in solution speed and enhanced solution accuracy.

Quantum particle swarm optimization algorithm based on diversity migration strategy

Particle swarm optimization algorithm has been successfully applied to solve practical optimization problems due to its simplicity and efficiency. However, the traditional particle swarm optimization algorithm has inferior search performance in complicated high-dimensional optimization issues and is prone to falling into local optima. To address these problems, a new migration mechanism is introduced and a quantum particle swarm optimization method based on diversity migration is proposed. The strategy can capture different ranges of particles in the population, and the selection of migrating individuals depends not only on their fitness values but is also influenced by the positions within the population. The individual with the minimal average Hamming distance in the population can indicate the direction of iterative population optimization. After comparing the fitness values and the average Hamming distance between particles, the particles deviating from the central range of the population are replaced. The performance of the proposed algorithm is investigated under seven different sets of benchmark function optimization problems in the CEC2020 single-objective boundary-constrained optimization competition, and is compared with those of several other representative optimization algorithms. The quantum particle swarm optimization algorithm based on diversity migration strategy outperforms other typical optimization algorithms. Moreover, the proposed algorithm is convergent and stable.

Multi-Objective Optimal Scheduling of Microgrids Based on Improved Particle Swarm Algorithm

Microgrid optimization scheduling, as a crucial part of smart grid optimization, plays a significant role in reducing energy consumption and environmental pollution. The development goals of microgrids not only aim to meet the basic demands of electricity supply but also to enhance economic benefits and environmental protection. In this regard, a multi-objective optimization scheduling model for microgrids in grid-connected mode is proposed, which comprehensively considers the operational costs and environmental protection costs of microgrid systems. This model also incorporates improvements to the traditional particle swarm optimization (PSO) algorithm by considering inertia factors and particle adaptive mutation, and it utilizes the improved algorithm to solve the optimization model. Simulation results demonstrate that this model can effectively reduce electricity costs for users and environmental pollution, promoting the optimized operation of microgrids and verifying the superior performance of the improved PSO algorithm. After algorithmic improvements, the optimal total cost achieved was CNY 836.23, representing a decrease from the pre-improvement optimal value of CNY 850.

A novel method for estimation of electrode kinetics parameters

PurposeThe purpose of this paper is to extract electrochemical reaction kinetics parameters, such as Tafel slope, exchange current density and equilibrium potential, which cannot be directly measured, this study aims to propose an improved particle swarm optimization (PSO) algorithm.Design/methodology/approachIn traditional PSO algorithms, each particle’s historical optimal solution is compared with the global optimal solution in each iteration step, and the optimal solution is replaced with a certain probability to achieve the goal of jumping out of the local optimum. However, this will to some extent undermine the (true) optimal solution. In view of this, this study has improved the traditional algorithm: at each iteration of each particle, the historical optimal solution is not compared with the global optimal solution. Instead, after all particles have iterated, the optimal solution is selected and compared with the global optimal solution and then the optimal solution is replaced with a certain probability. This to some extent protects the global optimal solution.FindingsThe polarization curve plotted by this equation is in good agreement with the experimental values, which demonstrates the reliability of this algorithm and provides a new method for measuring electrochemical parameters.Originality/valueThis study has improved the traditional method, which has high accuracy and can provide great support for corrosion research.

A Random Particle Swarm Optimization Based on Cosine Similarity for Global Optimization and Classification Problems.

In today's fast-paced and ever-changing environment, the need for algorithms with enhanced global optimization capability has become increasingly crucial due to the emergence of a wide range of optimization problems. To tackle this issue, we present a new algorithm called Random Particle Swarm Optimization (RPSO) based on cosine similarity. RPSO is evaluated using both the IEEE Congress on Evolutionary Computation (CEC) 2022 test dataset and Convolutional Neural Network (CNN) classification experiments. The RPSO algorithm builds upon the traditional PSO algorithm by incorporating several key enhancements. Firstly, the parameter selection is adapted and a mechanism called Random Contrastive Interaction (RCI) is introduced. This mechanism fosters information exchange among particles, thereby improving the ability of the algorithm to explore the search space more effectively. Secondly, quadratic interpolation (QI) is incorporated to boost the local search efficiency of the algorithm. RPSO utilizes cosine similarity for the selection of both QI and RCI, dynamically updating population information to steer the algorithm towards optimal solutions. In the evaluation using the CEC 2022 test dataset, RPSO is compared with recent variations of Particle Swarm Optimization (PSO) and top algorithms in the CEC community. The results highlight the strong competitiveness and advantages of RPSO, validating its effectiveness in tackling global optimization tasks. Additionally, in the classification experiments with optimizing CNNs for medical images, RPSO demonstrated stability and accuracy comparable to other algorithms and variants. This further confirms the value and utility of RPSO in improving the performance of CNN classification tasks.

MRPSO-Loc: Multi-targets UHF RFID localization system based on MRPSO algorithm

Existing RFID localization techniques mainly focus on the location of a single target, which do not fully utilize the multi-targets identification merit of UHF RFID systems. In this paper, a multi-targets localization algorithm called merged re-shaken particle swarm optimization (MRPSO) is proposed. The ranging information and the angle information, which are obtained by using multi-frequency phase information with the help of frequency hopping technique, are merged together during the iteration process of MRPSO. In addition, based on the traditional PSO algorithm, a low weight particle filtering method was proposed, and a re-shaken scheme was introduced to improve localization accuracy. By allocating particles to each target, MRPSO can obtain each target location simultaneously after PSO process, which avoids time consuming. The experimental results show that MRPSO can achieve single-station multi-target localization with a median accuracy of 9.64 cm.

Method of inclined hole axis adjustment based on geometric optimization and minimum zone theory

The machining accuracy of the axis position and spatial angle of the array microholes with high aspect ratio on the components of the high-end equipment manufacturing industry will directly affect the performance of the whole machine. A method of tilt hole axis adjustment is proposed in this paper. It utilizes geometric optimization and minimum zone theory to measure the position and spatial angle of the hole axis. This addresses the slight angle error that occurs after correcting the inclined hole axis using visual techniques. Based on the minimum zone criterion for the cylindricity error, the evaluation model is re-established through the inner and the outer loop and spatial projection, which includes roundness evaluation of the projection curve by an improved particle swarm optimization (PSO) algorithm and elliptic fitting by a geometric parameter method, so as to obtain the optimal solution of the axis vector and spatial angle. Experimental comparison with the theory above shows that the precision of the method proposed is better than that of the least squares method and the traditional PSO algorithm based on the minimum zone criterion. The research results indicate that the precision of the tilt angle is better than 0.03°, and simultaneously the rotation angle is better than 0.1° in the range of 1°. This experiment verifies the effectiveness and accuracy of the proposed method.

An approach for low-power heterogeneous parallel implementation of ALC-PSO algorithm using OmpSs and CUDA

PSO (particle swarm optimization), is an intelligent search method for finding the best solution according to population state. Various parallel implementations of this algorithm have been presented for intensive-computing applications. The ALC-PSO algorithm (PSO with an aging leader and challengers) is an improved population-based procedure that increases convergence rapidity, compared to the traditional PSO. In this paper, we propose a low-power heterogeneous parallel implementation of ALC-PSO algorithm using OmpSs and CUDA, for execution on both CPU and GPU cores. This is the first effort to heterogeneous parallel implementing ALC-PSO algorithm with combination of OmpSs and CUDA. This hybrid parallel programming approach increases the performance and efficiency of the intensive-computing applications. The proposed approach of this article is also useful and applicable for heterogeneous parallel execution of the other improved versions of PSO algorithm, on both CPUs and GPUs. The results demonstrate that the proposed approach provides higher performance, in terms of delay and power consumption, than the existence implementations of ALC-PSO algorithm.

A particle swarm optimization and prior knowledge fusion seismic damage prediction of concrete structures

A data-driven algorithm is developed to predict local seismic damage distribution of concrete structures based on the measured global structural response. Based on the algorithm, the signal of reaction force and displacement at one location is only necessary for seismic damage prediction. The algorithm is established based on the improved particle swarm optimization with two innovative strategies. One is the probabilistic mutation procedure, which can consider the prior knowledge of the positive correlation between the strain/stress level and damage level in the seismic damage optimization process. Another is the dynamic condition-based mutation and cross procedure, which can increase the diversity of the particle swarm in the optimization process to get rid of the possible local optimum. A representative example of a concrete column under cyclic load is designed and modeled to examine the performance of the algorithm. The prediction results based on the algorithm are compared with the traditional particle swarm optimization and the previous damage inversion algorithm based on ant colony optimization. The comparison results support that the local seismic damage distribution prediction based on the algorithm is closer to the corresponding experimental result. In addition, the error of the predicted macroscopic response in the final seismic stage based on the algorithm is 1.7%. The prediction error of the traditional particle swarm optimization algorithm is 12.6%, and the prediction error of the previous damage inversion algorithm based on ant colony optimization is 8.5%. The ability of the proposed algorithm is supported, which can be capable of seismic damage prediction of concrete structures subjected to earthquakes.

Study of convergence speed of chaotic particle swarm optimization algorithm

AbstractThis study introduces the Chaotic Particle Swarm Optimization as an innovative variant of the traditional particle swarm optimization algorithm, addressing the issue of particle swarm optimization getting trapped in local minima with a low convergence characteristic during later iterations. Chaotic particle swarm optimization incorporates principles from chaos theory to enhance the swarm's exploration and exploitation capabilities. By introducing controlled chaotic behavior, particles exhibit more diverse and unpredictable movements in the search space, leading to improved global convergence and escape from local minima. The proposed method has been implemented and evaluated on benchmark problems to assess its effectiveness. The integration of chaos theory with particle swarm optimization offers promising opportunities for developing robust and efficient optimization techniques suitable for complex and dynamic problem domains in various real-world applications.

A Novel Supercapacitor Model Parameters Identification Method Using Metaheuristic Gradient-Based Optimization Algorithms

This paper addresses the critical role of supercapacitors as energy storage systems with a specific focus on their modeling and identification. The lack of a standardized and efficient method for identifying supercapacitor parameters has a definite effect on widespread adoption of supercapacitors, especially in high-power density applications like electric vehicle regenerative braking. The study focuses on parameterizing the Zubieta model for supercapacitors, which involves identifying seven parameters using a hybrid metaheuristic gradient-based optimization (MGBO) approach. The effectiveness of the MGBO method is compared to the existing particle swarm optimization (PSO) and to the following algorithms proposed and developed in this work: ‘modified MGBO’ (M-MGBO) and two PSO variations—one combining PSO and M-MGBO and the other incorporating a local escaping operator (LCEO) with PSO. Metaheuristic- and gradient-based algorithms are both affected by problems associated with locally optimal results and with issues related to enforcing constraints/boundaries on solution values. This work develops the above-mentioned innovations to the MGBO and PSO algorithms for addressing such issues. Rigorous experimentation considering various types of input excitation provides results indicating that hybrid PSO-MGBO and PSO-LCEO outperform traditional PSO, showing improvements of 51% and 94%, respectively, while remaining comparable to M-MGBO. These hybrid approaches effectively estimate Zubieta model parameters. The findings highlight the potential of hybrid optimization strategies in enhancing precision and effectiveness in supercapacitor model parameterization.

Adaptive threshold optimisation for online feature selection using dynamic particle swarm optimisation in determining feature relevancy and redundancy

In the era of data-driven decision-making, managing dynamic data streams characterised by evolving data distributions and high dimensionality presents a formidable challenge for online feature selection. This research addresses the challenge by developing innovative solutions in optimising Online Feature Selection (OFS) to manage feature irrelevancy and redundancy and rigorously validating the proposed method in high-dimensional dynamic data streams. The research employs a structured methodology, introducing a novel method: a Dynamic Particle Swarm Optimisation (PSO)-based Threshold Optimisation method. Dynamic PSO, injected on three benchmark methods of OFS (i.e., Online Streaming Feature Selection (OSFS), Fast-OSFS, and Scalable and Accurate Online Feature Selection for Big Data (SAOLA)), enabled the global best position to be dynamically adjusted to exploit the best solution found in streaming data. This research presents two optimisation variants of the proposed method: RedundantPSO, which optimises redundant features, and IrrelevantPSO, which optimises irrelevant features. Unlike the traditional PSO method on feature selection that uses feature encoding representation, the proposed method is underpinned by two contributions: adaptive threshold particle representation of particle swarm optimisation and enhanced fitness function using minimisation of mean absolute deviation of dependency among feature subsets. Adaptive threshold particle representation combines the feature encoding part with a novel aspect that defines a threshold value of significance level ranging from 0.01 to 0.1. This unique contribution sets the research apart in the field where it enables the adaptive adjustment of the threshold value based on incoming features. Next, the adaptation of Mean Absolute Deviation (MAD) was integrated into the fitness evaluation of PSO to gain a more accurate and reliable measure of fitness for feature selection. During the experiment phase, we analysed various benchmark datasets with highly redundant and relevant behaviour. Our analysis concluded that selecting the appropriate threshold values significantly improved model performance for high-redundancy datasets, highlighting the need for careful threshold selection. The experimental evaluations have revealed that integrating RedundantPSO with OSFS (OSFS+RedundantPSO) resulted in a remarkable enhancement of the OSFS method's accuracy, achieving an impressive average accuracy rate of 76.8%. This substantial improvement includes occasional spikes of up to 3.8% over the baseline OSFS accuracy, showcasing OSFS+RedundantPSO as the top-performing combination. Furthermore, Fast-OSFS + RedundantPSO outperformed Fast-OSFS by a slight margin, reaching an average accuracy of 72.7%, while SAOLA + RedundantPSO exhibited a substantial 3.1% increase in average accuracy over SAOLA, reaching 74.0%. It is noteworthy to highlight that the threshold value searched in the proposed method also significantly impacted the identification of the behaviour of the dataset, either high relevancy or redundancy, even in the absence of prior domain knowledge. A higher threshold signifies the evaluation of a more redundant feature space. In conclusion, the results demonstrated the significant contributions of the method in enhancing model accuracy, adapting to evolving data distributions, and optimising feature subsets with acceptable runtime. The research aims to advance the field of data science, such as cybersecurity, finance, healthcare and more, while empowering end-users to make informed decisions under changing data stream circumstances.