2篇
您的检索式：作者名="R.Manjula Devi"
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | 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. | R.Manjula Devi M.Premkumar Pradeep Jangir Mohamed Abdelghany Elkotb Rajvikram Madurai Elavarasan Kottakkaran Sooppy Nisar | 2022 | Computers, Materials & Continua2022，，3： | 0 |
| 2 | 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. | R.Manjula Devi M.Premkumar Pradeep Jangir B.Santhosh Kumar Dalal Alrowaili Kottakkaran Sooppy Nisar | 2022 | Computers, Materials & Continua2022，，1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员