An Improved Reptile Search Algorithm Based on Cauchy Mutation for Intrusion Detection

With the growth of the discipline of digital communication,the topic has acquiredmore attention in the cybersecuritymedium.The Intrusion Detection(ID)system monitors network traffic to detect malicious activities.The paper introduces a novel Feature Selection(FS)approach for ID.Reptile Search Algorithm(RSA)—is a new optimization algorithm;in this method,each agent searches a new region according to the position of the host,which makes the algorithm suffers from getting stuck in local optima and a slow convergence rate.To overcome these problems,this study introduces an improved RSA approach by integrating Cauchy Mutation(CM)into the RSA’s structure.Thus,the CM can effectively expand search space and enhance the performance of the RSA.The developed RSA-CM is assessed on five publicly available ID datasets:KDD-CUP99,NSL-KDD,UNSW-NB15,CIC-IDS2017,and CIC-IDS2018 and two engineering problems.The RSA-CM is compared with the original RSA,and three other state-of-the-art FS methods,namely particle swarm optimization,grey wolf optimization,and multi-verse optimizer,and quantitatively is evaluated using fitness value,the number of selected optimum features,accuracy,precision,recall,and F1-score evaluationmeasures.The results reveal that the developed RSA-CMgot better results than the other competitive methods applied for FS on the ID datasets and the examined engineering problems.Moreover,the Friedman test results confirm that RSA-CMhas a significant superiority compared to other methods as an FS method for ID.

An Enhanced Equilibrium Optimizer for Solving Optimization Tasks

The equilibrium optimizer(EO)represents a new,physics-inspired metaheuristic optimization approach that draws inspiration from the principles governing the control of volume-based mixing to achieve dynamic mass equilibrium.Despite its innovative foundation,the EO exhibits certain limitations,including imbalances between exploration and exploitation,the tendency to local optima,and the susceptibility to loss of population diversity.To alleviate these drawbacks,this paper introduces an improved EO that adopts three strategies:adaptive inertia weight,Cauchy mutation,and adaptive sine cosine mechanism,called SCEO.Firstly,a new update formula is conceived by incorporating an adaptive inertia weight to reach an appropriate balance between exploration and exploitation.Next,an adaptive sine cosine mechanism is embedded to boost the global exploratory capacity.Finally,the Cauchy mutation is utilized to prevent the loss of population diversity during searching.To validate the efficacy of the proposed SCEO,a comprehensive evaluation is conducted on 15 classical benchmark functions and the CEC2017 test suite.The outcomes are subsequently benchmarked against both the conventional EO,its variants,and other cutting-edge metaheuristic techniques.The comparisons reveal that the SCEO method provides significantly superior results against the standard EO and other competitors.In addition,the developed SCEO is implemented to deal with a mobile robot path planning(MRPP)task,and compared to some classical metaheuristic approaches.The analysis results demonstrate that the SCEO approach provides the best performance and is a prospective tool for MRPP.

Firefly algorithm with division of roles for complex optimal scheduling

A single strategy used in the firefly algorithm(FA)cannot effectively solve the complex optimal scheduling problem.Thus,we propose the FA with division of roles(DRFA).Herein,fireflies are divided into leaders,developers,and followers,while a learning strategy is assigned to each role:the leader chooses the greedy Cauchy mutation;the developer chooses two leaders randomly and uses the elite neighborhood search strategy for local development;the follower randomly selects two excellent particles for global exploration.To improve the efficiency of the fixed step size used in FA,a stepped variable step size strategy is proposed to meet different requirements of the algorithm for the step size at different stages.Role division can balance the development and exploration ability of the algorithm.The use of multiple strategies can greatly improve the versatility of the algorithm for complex optimization problems.The optimal performance of the proposed algorithm has been verified by three sets of test functions and a simulation of optimal scheduling of cascade reservoirs.