BHGSO:Binary Hunger Games Search Optimization Algorithm for Feature Selection Problem

In machine learning and data mining,feature selection(FS)is a traditional and complicated optimization problem.Since the run time increases exponentially,FS is treated as an NP-hard problem.The researcher’s effort to build a new FS solution was inspired by the ongoing need for an efficient FS framework and the success rates of swarming outcomes in different optimization scenarios.This paper presents two binary variants of a Hunger Games Search Optimization(HGSO)algorithm based on V-and S-shaped transfer functions within a wrapper FS model for choosing the best features from a large dataset.The proposed technique transforms the continuous HGSO into a binary variant using V-and S-shaped transfer functions(BHGSO-V and BHGSO-S).To validate the accuracy,16 famous UCI datasets are considered and compared with different state-of-the-art metaheuristic binary algorithms.The findings demonstrate that BHGSO-V achieves better performance in terms of the selected number of features,classification accuracy,run time,and fitness values than other state-of-the-art algorithms.The results demonstrate that the BHGSO-V algorithm can reduce dimensionality and choose the most helpful features for classification problems.The proposed BHGSO-V achieves 95%average classification accuracy for most of the datasets,and run time is less than 5 sec.for low and medium dimensional datasets and less than 10 sec for high dimensional datasets.

IRKO:An Improved Runge-Kutta Optimization Algorithm for Global Optimization Problems

Optimization is a key technique for maximizing or minimizing functions and achieving optimal cost,gains,energy,mass,and so on.In order to solve optimization problems,metaheuristic algorithms are essential.Most of these techniques are influenced by collective knowledge and natural foraging.There is no such thing as the best or worst algorithm;instead,there are more effective algorithms for certain problems.Therefore,in this paper,a new improved variant of a recently proposed metaphorless Runge-Kutta Optimization(RKO)algorithm,called Improved Runge-Kutta Optimization(IRKO)algorithm,is suggested for solving optimization problems.The IRKO is formulated using the basic RKO and local escaping operator to enhance the diversification and intensification capability of the basic RKO version.The performance of the proposed IRKO algorithm is validated on 23 standard benchmark functions and three engineering constrained optimization problems.The outcomes of IRKO are compared with seven state-of-the-art algorithms,including the basic RKO algorithm.Compared to other algorithms,the recommended IRKO algorithm is superior in discovering the optimal results for all selected optimization problems.The runtime of IRKO is less than 0.5 s for most of the 23 benchmark problems and stands first for most of the selected problems,including real-world optimization problems.

Multi-Objective Grey Wolf Optimization Algorithm for Solving Real-World BLDC Motor Design Problem

The first step in the design phase of the Brushless Direct Current(BLDC)motor is the formulation of the mathematical framework and is often used due to its analytical structure.Therefore,the BLDC motor design problem is considered to be an optimization problem.In this paper,the analytical model of the BLDC motor is presented,and it is considered to be a basis for emphasizing the optimization methods.The analytical model used for the experimentation has 78 non-linear equations,two objective functions,five design variables,and six non-linear constraints,so the BLDC motor design problem is considered as highly non-linear in electromagnetic optimization.Multi-objective optimization becomes the forefront of the current research to obtain the global best solution using metaheuristic techniques.The bio-inspired multi-objective grey wolf optimizer(MOGWO)is presented in this paper,and it is formulated based on Pareto optimality,dominance,and archiving external.The performance of theMOGWO is verified on standard multi-objective unconstraint benchmark functions and applied to the BLDC motor design problem.The results proved that the proposedMOGWO algorithm could handle nonlinear constraints in electromagnetic optimization problems.The performance comparison in terms of Generational Distance,inversion GD,Hypervolume-matrix,scattered-matrix,and coverage metrics proves that the MOGWO algorithm can provide the best solution compared to other selected algorithms.The source code of this paper is backed up with extra online support at https://premkumarmanoharan.wixsite.com/mysite and https://www.mathworks.com/matlabcentral/fileexchange/75259-multiobjective-non-sorted-grey-wolf-mogwo-nsgwo.

A New Metaheuristic Optimization Algorithms for Brushless Direct Current Wheel Motor Design Problem

The Equilibrium Optimizer(EO),Grey Wolf Optimizer(GWO),and Whale Optimizer(WO)algorithms are being recently developed for engineering optimization problems.In this paper,the EO,GWO,and WO algorithms are applied individually for a brushless direct current(BLDC)design optimization problem.The EO algorithm is inspired by the models utilized to find the system’s dynamic state and equilibrium state.The GWO and WO algorithms are inspired by the hunting behavior of the wolf and the whale,respectively.The primary purpose of any optimization technique is to find the optimal configuration by maximizing motor efficiency and/or minimizing the total mass.Therefore,two objective functions are being used to achieve these objectives.The first refers to a design with high power output and efficiency.The second is a constraint imposed by the reality that the motor is built into the wheel of the vehicle and,therefore,a lightweight is needed.The EO,GWO,and WOA algorithms are then utilized to optimize the BLDC motor’s design variables to minimize the motor’s total mass or maximize the motor efficiency by simultaneously satisfying the six inequality constraints.The simulation is carried out using MATLAB simulation software,and the simulation results prove the dominance of the proposed algorithms.This paper also suggests an efficient method from the proposed three methods for the BLDC motor design optimization problem.