Levy Flight Research Articles

Intrusion detection based on hybrid metaheuristic feature selection

Abstract The multidimensional features of network flows are the main data source for intrusion detection, but excessively low-value features generate accuracy and efficiency challenges. Researchers have used redundant feature reduction to simplify intrusion detections, and feature selection algorithms are beginning to be widely used. This paper presents a novel hybrid feature selection algorithm, CSA-FPA, which combines both a crow search algorithm and a flower pollination algorithm. In this method, properties such as local pollination and the levy flight of FPA are used to balance the global search and local search efficiencies, and parameters such as group distance and probability thresholds are introduced to customize the model’s appearance. The simulation results on the UNSW-NB15 and CIC-IDS2017 datasets show that the proposed CSA-FPA method achieves better detection accuracies than previous algorithms. Using the proposed feature selection method, the AdaBoost classifier achieved a detection accuracy of 99.14% on the CIC-IDS2017 dataset and 97.98% on the UNSW-NB15 dataset.

Hybrid Artificial Protozoa-Based JADE for Attack Detection

This paper presents a novel hybrid optimization algorithm that combines JADE Adaptive Differential Evolution with Artificial Protozoa Optimizer (APO) to solve complex optimization problems and detect attacks. The proposed Hybrid APO-JADE Algorithm leverages JADE’s adaptive exploration capabilities and APO’s intensive exploitation strategies, ensuring a robust search process that balances global and local optimization. Initially, the algorithm employs JADE’s mutation and crossover operations, guided by adaptive control parameters, to explore the search space and prevent premature convergence. As the optimization progresses, a dynamic transition to the APO mechanism is implemented, where Levy flights and adaptive change factors are utilized to refine the best solutions identified during the exploration phase. This integration of exploration and exploitation phases enhances the algorithm’s ability to converge to high-quality solutions efficiently. The performance of the APO-JADE was verified via experimental simulations and compared with state-of-the-art algorithms using the 2022 IEEE Congress on Evolutionary Computation benchmark (CEC) 2022 and 2021. Results indicate that APO-JADE achieved outperforming results compared with the other algorithms. Considering practicality, the proposed APO-JADE was used to solve a real-world application in attack detection and tested on DS2OS, UNSW-NB15, and ToNIoT datasets, demonstrating its robust performance.

Levy Sooty Tern Optimization Algorithm Builds DNA Storage Coding Sets for Random Access.

DNA molecules, as a storage medium, possess unique advantages. Not only does DNA storage exhibit significantly higher storage density compared to electromagnetic storage media, but it also features low energy consumption and extremely long storage times. However, the integration of DNA storage into daily life remains distant due to challenges such as low storage density, high latency, and inevitable errors during the storage process. Therefore, this paper proposes constructing a DNA storage coding set based on the Levy Sooty Tern Optimization Algorithm (LSTOA) to achieve an efficient random-access DNA storage system. Firstly, addressing the slow iteration speed and susceptibility to local optima of the Sooty Tern Optimization Algorithm (STOA), this paper introduces Levy flight operations and propose the LSTOA. Secondly, utilizing the LSTOA, this paper constructs a DNA storage encoding set to facilitate random access while meeting combinatorial constraints. To demonstrate the coding performance of the LSTOA, this paper consists of analyses on 13 benchmark test functions, showcasing its superior performance. Furthermore, under the same combinatorial constraints, the LSTOA constructs larger DNA storage coding sets, effectively reducing the read-write latency and error rate of DNA storage.

A Method for Optimizing Terminal Sliding Mode Controller Parameters Based on a Multi-Strategy Improved Crayfish Algorithm

This paper proposes a parameter optimization method for a terminal sliding mode controller (TSMC) based on a multi-strategy improved crayfish algorithm (JLSCOA) to enhance the performance of ship dynamic positioning systems. The TSMC is designed for the “Xinhongzhuan” vessel of Dalian Maritime University. JLSCOA integrates subtractive averaging, Levy Flight, and sparrow search strategies to overcome the limitations of traditional crayfish algorithms. Compared to COA, WOA, and SSA algorithms, JLSCOA demonstrates superior optimization accuracy, convergence performance, and stability across 12 benchmark test functions. It achieves the optimal value in 83% of cases, outperforms the average in 83% of cases, and exhibits stronger robustness in 75% of cases. Simulations show that applying JLSCOA to TSMC parameter optimization significantly outperforms traditional non-optimized controllers, reducing the average time for three degrees of freedom position changes by over 300 s and nearly eliminating control force and velocity oscillations.

PBb-LMFO: a levy flight integrated MFO inspired ensemble model for cancer diagnosis

PBb-LMFO: a levy flight integrated MFO inspired ensemble model for cancer diagnosis

Novel modified Chernobyl disaster optimizer for controlling DC motor

This article presents the modified Chernobyl disaster optimizer (CDO) method for DC motor control to find the optimal proportional integral derivative (PID) settings. DC motors are widely used machinery. DC motors are also simple to use. The detonation of the Chernobyl nuclear reactor core served as the inspiration for the idea and guiding principles of the CDO. CDO has limitations in the stability of exploration and exploitation areas. This research aims to obtain a new balance of exploration and exploitation. This study suggests incorporating the levy flight and chaotic algorithm (CA) techniques to enhance the CDO method. This study was conducted with the MATLAB/Simulink software. A comparative technique, which included the marine predator algorithm (MPA), golden jackal optimization (GJO), and CDO, was utilized to determine the performance of the MCDO method. According to the study’s findings, the MCDO method’s overshoot value outperformed all other approaches.

FOX Optimization Algorithm Based on Adaptive Spiral Flight and Multi-Strategy Fusion.

Adaptive spiral flight and multi-strategy fusion are the foundations of a new FOX optimization algorithm that aims to address the drawbacks of the original method, including weak starting individual ergodicity, low diversity, and an easy way to slip into local optimum. In order to enhance the population, inertial weight is added along with Levy flight and variable spiral strategy once the population is initialized using a tent chaotic map. To begin the process of implementing the method, the fox population position is initialized using the created Tent chaotic map in order to provide more ergodic and varied individual beginning locations. To improve the quality of the solution, the inertial weight is added in the second place. The fox random walk mode is then updated using a variable spiral position updating approach. Subsequently, the algorithm's global and local searches are balanced, and the Levy flying method and greedy approach are incorporated to update the fox location. The enhanced FOX optimization technique is then thoroughly contrasted with various swarm intelligence algorithms using engineering application optimization issues and the CEC2017 benchmark test functions. According to the simulation findings, there have been notable advancements in the convergence speed, accuracy, and stability, as well as the jumping out of the local optimum, of the upgraded FOX optimization algorithm.

Autonomous Underwater Vehicle Path Planning Based on Improved Salp Swarm Algorithm

Aiming at the problem of path planning for autonomous underwater vehicle (AUV) to cope with the influence of obstacles and eddies in complex marine environments, a path planning method based on an improved salp swarm algorithm (ISSA) is proposed. Firstly, the motion model of the AUV and eddy current model are constructed, including the relationship between position, velocity, attitude, and control inputs. Secondly, the improved SSA is proposed, which introduces the Levy flight strategy to enhance the algorithm’s optimization seeking ability and adds a nonlinear convergence factor to enhance the convergence ability of the algorithm. The stability and robustness of the improved algorithm are verified by test functions. Finally, the ISSA is applied to AUV path planning, which optimizes the AUV travel distance, improves the search efficiency and accuracy, and avoids the local optimum of the algorithm. The ISSA enhances the adaptive ability and robustness of the algorithm by introducing a dynamic adjustment strategy and feedback mechanism. Experimental verification is carried out using a simulated marine environment. The results show that the ISSA is better than the traditional algorithm in terms of path length as well as algorithm stability, and can effectively improve the navigation performance of AUV.

An improved differential evolution with adaptive population allocation and mutation selection

In order to improve the performance of differential evolution (DE) for different optimization problems, an improved DE with adaptive population allocation and mutation selection (iDE-APAMS) is proposed. First, different mutation strategies are selected to constitute the exploration strategy pool and the exploitation strategy pool. The exploration strategy pool is mainly used for global search to increase the population diversity; the exploitation strategy pool is primarily used for local search to accelerate the convergence and improve the solution accuracy. Second, different mutation strategies obtain population resources dynamically through cooperation and competition. Mutation strategies in the same strategy pool first compete for population resources with mutation strategies in the other strategy pool through cooperation, and in this way the population is allocated between the two strategy pools. Then within each strategy pool, different mutation strategies compete with each other to obtain corresponding population resources. Third, mutation scale factor and crossover rate are adaptively adjusted based on population diversity and fitness improvement. Finally, the Levy random walk is applied to individuals with better fitness at the later stage of the iteration to avoid falling into local optima and further improve the accuracy of the solution. The iDE-APAMS is compared with 4 classical DE variants and 11 state-of-the-art algorithms on the CEC2013, CEC2014, and CEC2017 benchmark test suites respectively, and it is also tested on 22 real-world optimization problems in CEC2011. The results show that iDE-APAMS can improve the convergence of the algorithm and the stability of the solution, and it is statistically significantly better than the comparison algorithms.

An improved equilibrium optimization algorithm for feature selection problem in network intrusion detection

In this paper, an enhanced equilibrium optimization (EO) version named Levy-opposition-equilibrium optimization (LOEO) is proposed to select effective features in network intrusion detection systems (IDSs). The opposition-based learning (OBL) approach is applied by this algorithm to improve the diversity of the population. Also, the Levy flight method is utilized to escape local optima. Then, the binary rendition of the algorithm called BLOEO is employed to feature selection in IDSs. One of the main challenges in IDSs is the high-dimensional feature space, with many irrelevant or redundant features. The BLOEO algorithm is designed to intelligently select the most informative subset of features. The empirical findings on NSL-KDD, UNSW-NB15, and CIC-IDS2017 datasets demonstrate the effectiveness of the BLOEO algorithm. This algorithm has an acceptable ability to effectively reduce the number of data features, maintaining a high intrusion detection accuracy of over 95%. Specifically, on the UNSW-NB15 dataset, BLOEO selected only 10.8 features on average, achieving an accuracy of 97.6% and a precision of 100%.

A Modified Levy Flight Firefly-Based Approach to Optimize Turnaround Time in Fog Computing Environments

The escalation of Internet of Things (IoT) devices has led to increased data generation at the network edge that has burdened the cloud infrastructure in terms of handling and processing of data. This has led to the rapid adoption of fog computing because of its ability to bring computation and storage closer to the edge and support for real-time applications and services by reducing latency. One of the foremost challenges in the fog computing arena is minimizing turnaround time. This research paper proposes a Modified Levy Flight Firefly Algorithm (MLFFA) to optimize task scheduling for fog computing environments. Specifically, the objective is to minimize the turnaround time of tasks. Moreover, genetic operators like crossover and mutation are also employed to achieve an optimal balance between exploration and exploitation. Experimental observations undertaken show that the proposed method improves the average turnaround time by 55%, 22%, and 13%, average waiting time by 59%, 45%, and 37%, average energy consumption by 19%, 7%, and 4%, and average failure rate by 50%, 28%, and 7% compared to the existing studies, namely Load Balancing and Optimization Strategy (LBOS), Technique for Resource Allocation and Management (TRAM), and Fuzzy Golden Eagle Load Balancing (FGELB), respectively.

A Short-Term Wind Speed Forecasting Framework Coupling a Maximum Information Coefficient, Complete Ensemble Empirical Mode Decomposition with Adaptive Noise, Shared Weight Gated Memory Network with Improved Northern Goshawk Optimization for Numerical Weather Prediction Correction

In line with global carbon-neutral policies, wind power generation has received widespread public attention, which can enhance the security of supply and social sustainability. Since wind with non-stationarity and randomness makes power systems unstable, precise wind speed forecasting is an integral part of wind farm scheduling and management. Therefore, a compound short-term wind speed forecasting framework based on numerical weather prediction (NWP) is proposed coupling a maximum information coefficient (MIC), complete ensemble empirical mode decomposition with adaptive noise (CEEMDAN), shared weight gated memory network (SWGMN) with improved northern goshawk optimization (INGO). Firstly, numerical weather prediction is adopted to acquire the predicted variables with different domains, including the predicted wind speed and other predicted meteorological variables, after which the error is calculated using the predicted and actual wind speeds. Then, the correlation between the predicted variables and the error is obtained using the MIC to select the correlation factors. Subsequently, CEEMDAN is employed to decompose the correlation factors, corresponding the actual factors and the error into a series of subsequences, which are regarded as the input series. After that, the input series is fed into the proposed SWGMN to forecast each subsequent error, respectively, in which the shared gate is proposed to replace the input gate, the forgetting gate and the output gate. Meanwhile, the proposed INGO based on northern goshawk optimization (NGO), the levy flight disturbance strategy and the nonlinear contraction strategy is applied to calibrate the parameters of the SWGMN. Finally, the forecasting values are acquired by summing the forecasted error and the predicted wind speed from the NWP. The experimental results depict that the errors are small among all the models. Compared with the traditional method, the proposed framework achieves higher prediction accuracy and efficiency. The application of this framework not only assists in optimizing the operation and management of wind farms, but also reduces the dependence on fossil fuels, thereby promoting environmental protection and the sustainable use of resources.

An Efficient Modified Black Widow Optimized Node Localization in Wireless Sensor Network

Wireless Sensor Network (WSN) is an encouraging technology in various applications like atmosphere monitoring, vehicular systems, and targeting devices. Localization in WSN is performed to identify the current position or coordinates of sensor nodes. The crucial task of localization is to find coordinates without manual configuration and expensive hardware like GPS. This work proposes a new localization algorithm using Modified Black Widow Optimization (MBWO). The proposed method involves an optimal selection of anchor nodes to reduce localization errors. Black Widow Optimization (BWO) is a naturally inspired optimization algorithm encouraged by the unique coupling behaviour of black widow spiders. The performance of black widow optimization is improved by levy flight distribution to escape from local minima. Experimental results show that the proposed MBWO-optimized localization achieves a higher localized node count with minimized localized error compared to other optimization algorithms.

A stochastic model of discussion

We consider the duration of discussions in face-to-face contacts and propose a stochastic model to describe it. It is based on the points of a Levy flight where the duration of each contact corresponds to the size of the clusters produced during the walk. When confronting it to the data measured from proximity sensors, we show that several datasets obtained in different environments, are precisely reproduced by the model fixing a single parameter, the Levy index, to 1.15. We analyze the dynamics of the cluster formation during the walk and compute analytically the cluster size distribution. We find that discussions are first driven by a maximum-entropy geometric distribution and then by a rich-get-richer mechanism reminiscent of preferential-attachment (the more a discussion lasts, the more it is likely to continue). In this model, conversations may be viewed as an aggregation process with a characteristic scale fixed by the mean interaction time between the two individuals.

An efficient multi-level thresholding method for breast thermograms analysis based on an improved BWO algorithm

Breast cancer is a prevalent disease and the second leading cause of death in women globally. Various imaging techniques, including mammography, ultrasonography, X-ray, and magnetic resonance, are employed for detection. Thermography shows significant promise for early breast disease detection, offering advantages such as being non-ionizing, non-invasive, cost-effective, and providing real-time results. Medical image segmentation is crucial in image analysis, and this study introduces a thermographic image segmentation algorithm using the improved Black Widow Optimization Algorithm (IBWOA). While the standard BWOA is effective for complex optimization problems, it has issues with stagnation and balancing exploration and exploitation. The proposed method enhances exploration with Levy flights and improves exploitation with quasi-opposition-based learning. Comparing IBWOA with other algorithms like Harris Hawks Optimization (HHO), Linear Success-History based Adaptive Differential Evolution (LSHADE), and the whale optimization algorithm (WOA), sine cosine algorithm (SCA), and black widow optimization (BWO) using otsu and Kapur's entropy method. Results show IBWOA delivers superior performance in both qualitative and quantitative analyses including visual inspection and metrics such as fitness value, threshold values, peak signal-to-noise ratio (PSNR), structural similarity index measure (SSIM), and feature similarity index (FSIM). Experimental results demonstrate the outperformance of the proposed IBWOA, validating its effectiveness and superiority.

A Novel Energy-Efficient Routing Protocol for Industrial WSN Using Hybrid Coot-Ls Algorithm with LSTM-Based Dom Prediction

In industrial Wireless Sensor Networks (WSNs), energy efficiency and reliable data transmission are critical challenges that need to be addressed to ensure sustainable and robust network operations. This paper proposes a novel energy-efficient routing protocol that integrates a Hybrid COOT-LS (Coot- Levy Search) algorithm with Long Short-Term Memory (LSTM)-based Dominant Object Motion (DOM) prediction. The routing protocol leverages the strengths of Hybrid Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) to enhance routing efficiency and reduce energy consumption. The Hybrid PSO and ACO algorithms are employed to optimize routing paths by balancing exploration and exploitation, considering multiple factors such as energy levels, node distance, and reliability. The COOT-LS algorithm further refines these paths by incorporating a Levy flight mechanism to enhance the search process. Additionally, the LSTM-based DOM prediction provides accurate forecasts of network conditions, enabling dynamic adjustments to routing strategies in real time. Simulation results demonstrate that the proposed protocol significantly improves network lifetime, reduces energy consumption, and enhances data transmission reliability compared to traditional routing protocols. This approach provides a robust and scalable solution for industrial WSN applications, ensuring efficient and reliable network performance in dynamic and complex industrial environments.

Levy flight based momentum search and Circle Rock Hyrax swarm optimization algorithms for energy effective clustering and optimal routing in wireless body area networks

In recent years, the connectivity of a new dimension has been brought to Wireless Body Area Networks (WBANs) through the concept of the Wearable Internet of Things (WIoT). WIoT offers valuable functionalities like data collection, analysis, and transmission for real-time health monitoring services. However, WBANs are characterized by a large number of battery-powered sensor nodes, making them resource-constrained. While keeping standard WSN abilities, WBAN's significant obstacles are data communication, social mobility, high interference in dense deployment, latency, and energy consumption of sensor nodes. As a result, the implementation and design of an application require dependable data transfer and an energy-efficient architecture. It proved critical to have as little delay as possible while delivering correct data. To overcome these issues, this study developed a novel energy-efficient clustered and optimized routing scheme in WBAN. Due to its effective scalability, this work employs an Improved Self-Executing Active Cross-Propagated (ISAC) clustering approach to form clusters in Wireless Body Area Networks (WBANs). Subsequently, the selection of the best Cluster Heads (CHs) is facilitated by the Levy Flight-based Momentum Search Algorithm (LFMSA). The Circle Rock Hyrax Swarm Optimization (CRH) algorithm is then utilized for energy-efficient routing. In determining the CH in each cluster, consideration is given to both residual energy and connectivity. The proposed framework minimizes the number of transmissions and overall transmission distance, optimizing inter and intra-cluster transmission distances. Additionally, the framework ensures energy-efficient packet delivery from CHs to the sink node. Performance comparisons, conducted using various statistical measures and simulated on the NS-2 platform, demonstrate that the proposed framework outperforms existing routing protocols and clustering methodologies. In comparison to previous methodologies, the proposed framework consistently achieves superior results.

Industrial Robot Trajectory Optimization Based on Improved Sparrow Search Algorithm

This paper proposes an enhanced multi-strategy sparrow search algorithm to optimize the trajectory of a six-axis industrial robot, addressing issues of low efficiency and high vibration impact on joints during operation. Initially, the improved D-H parametric method is employed to establish both forward and inverse kinematic models of the robot. Subsequently, a 3-5-3 mixed polynomial interpolation trajectory planning approach is applied to the robot. Building upon the conventional sparrow algorithm, a two-dimensional Logistic chaotic system initializes the population. Additionally, a Levy flight strategy and nonlinear adaptive weighting are introduced to refine the discoverer position update operator, while an inverse learning strategy enhances the vigilante position update operator. These modifications boost both the local and global search capabilities of the algorithm. The improved sparrow algorithm, based on 3-5-3 hybrid polynomial trajectory planning, is then used for the time-optimal trajectory planning of the robot. This is compared with traditional sparrow search algorithm and particle swarm algorithm optimization results. The findings indicate that the proposed enhanced sparrow search algorithm outperforms both the standard sparrow algorithm and the particle swarm algorithm in terms of convergence speed and accuracy for robot trajectory optimization. This can lead to the increased work efficiency and performance of the robot.

A novel LFSSA-LSTM algorithm for the remaining useful life prediction of lithium-ion batteries in whole life cycle

The accurate prediction of the remaining useful life (RUL) of lithium-ion batteries is essential to improve the safety of battery systems and optimize battery management strategies. Therefore, a new algorithm combining Sparrow search algorithm (SSA) improved by the Levy flight method and long short-term memory neural network (LSTM) is proposed in this paper. By extracting the National Aeronautics and Space Administration (NASA) battery aging datasets, the battery correlated health characteristics are obtained, and the deterioration trend of battery performance is effectively described. The sparrow search algorithm improved by the Levy flight method enhances the ability of the algorithm to jump out of the optimal solution. By using the improved algorithm, the hyper-parameter optimization problem of the long short-term memory network is solved, and the accuracy of the algorithm is improved. Finally, the probability density function is used to predict the remaining useful life of lithium-ion batteries, which effectively prevents the uncertainty caused by a single prediction result. Compared with long short-term memory neural network and the one optimized by a traditional sparrow search algorithm, the mean absolute error (MAE), root mean square error (RMSE), and mean absolute percentage error (MAPE) of the proposed algorithm are kept at 1.77 %, 2.24 %, and 1.25 %, respectively. The results indicate that the algorithm has better accuracy and fitting performance.

Parameter Optimization Method for Metal Surface pBRDF Model Based on Improved Strawberry Algorithm

To study the polarization reflection characteristics of metal surfaces, a parameter optimization method for the polarization bidirectional reflection distribution function (pBRDF) model of metal surfaces based on the improved strawberry algorithm has been proposed. Firstly, the light scattering characteristics of metal surfaces were analyzed and a multi-parameter pBRDF model was constructed. Then, the working mechanism of the strawberry optimization algorithm was investigated and improved by introducing the chaotic mapping and Levy flight strategy to overcome the shortcomings, such as low convergence rate and easily falling into local optimum. Finally, the method proposed in this paper was validated by simulating open-source data from references and the obtained ones with a self-built experimental platform. The results show that the proposed method outperforms those by nonlinear least squares, particle swarm optimization and the original strawberry algorithm in fitting the detected degree of polarization (DOP) data, indicating the modeling accuracy was significantly improved and better suited to characterize the polarized reflection properties of metal surfaces.