Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
There have been many algorithms created and introduced in the literature inspired by various events observable in nature, such as evolutionary phenomena, the actions of social creatures or agents, broad principles based on physical processes, the nature of chemical reactions, human behavior, superiority, and intelligence, intelligent behavior of plants, numerical techniques and mathematics programming procedure and its orientation. Nature-inspired metaheuristic algorithms have dominated the scientific literature and have become a widely used computing paradigm over the past two decades. Equilibrium Optimizer, popularly known as EO, is a population-based, nature-inspired meta-heuristics that belongs to the class of Physics based optimization algorithms, enthused by dynamic source and sink models with a physics foundation that are used to make educated guesses about equilibrium states. EO has achieved massive recognition, and there are quite a few changes made to existing EOs. This article gives a thorough review of EO and its variations. We started with 175 research articles published by several major publishers. Additionally, we discuss the strengths and weaknesses of the algorithms to help researchers find the variant that best suits their needs. The core optimization problems from numerous application areas using EO are also covered in the study, including image classification, scheduling problems, and many others. Lastly, this work recommends a few potential areas for EO research in the future.
There have been many algorithms created and introduced in the literature inspired by various events observable in nature, such as evolutionary phenomena, the actions of social creatures or agents, broad principles based on physical processes, the nature of chemical reactions, human behavior, superiority, and intelligence, intelligent behavior of plants, numerical techniques and mathematics programming procedure and its orientation. Nature-inspired metaheuristic algorithms have dominated the scientific literature and have become a widely used computing paradigm over the past two decades. Equilibrium Optimizer, popularly known as EO, is a population-based, nature-inspired meta-heuristics that belongs to the class of Physics based optimization algorithms, enthused by dynamic source and sink models with a physics foundation that are used to make educated guesses about equilibrium states. EO has achieved massive recognition, and there are quite a few changes made to existing EOs. This article gives a thorough review of EO and its variations. We started with 175 research articles published by several major publishers. Additionally, we discuss the strengths and weaknesses of the algorithms to help researchers find the variant that best suits their needs. The core optimization problems from numerous application areas using EO are also covered in the study, including image classification, scheduling problems, and many others. Lastly, this work recommends a few potential areas for EO research in the future.
This paper proposes improvements to the binary grey-wolf optimizer (BGWO) to solve the feature selection (FS) problem associated with high data dimensionality, irrelevant, noisy, and redundant data that will then allow machine learning algorithms to attain better classification/clustering accuracy in less training time. We propose three variants of BGWO in addition to the standard variant, applying different transfer functions to tackle the FS problem. Because BGWO generates continuous values and FS needs discrete values, a number of V-shaped, S-shaped, and U-shaped transfer functions were investigated for incorporation with BGWO to convert their continuous values to binary. After investigation, we note that the performance of BGWO is affected by the selection of the transfer function. Then, in the first variant, we look to reduce the local minima problem by integrating an exploration capability to update the position of the grey wolf randomly within the search space with a certain probability; this variant was abbreviated as IBGWO. Consequently, a novel mutation strategy is proposed to select a number of the worst grey wolves in the population which are updated toward the best solution and randomly within the search space based on a certain probability to determine if the update is either toward the best or randomly. The number of the worst grey wolf selected by this strategy is linearly increased with the iteration. Finally, this strategy is combined with IBGWO to produce the second variant of BGWO that was abbreviated as LIBGWO. In the last variant, simulated annealing (SA) was integrated with LIBGWO to search around the best-so-far solution at the end of each iteration in order to identify better solutions. The performance of the proposed variants was validated on 32 datasets taken from the UCI repository and compared with six wrapper feature selection methods. The experiments show the superiority of the proposed improved variants in producing better classification accuracy than the other selected wrapper feature selection algorithms.INDEX TERMS Grey-wolf optimizer, feature selection, simulated annealing, mutation strategy.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.