Journal of Computational Science · 2023 · 24 citations · 56 references
ComputingComputer ScienceAlgorithmsMachine LearningOptimizationDiscrete OptimizationFeature SelectionMetaheuristic OptimizationOptimization For Machine LearningOptimization ModelingOptimization TheoryDiscrete Equilibrium ModelingPopulation-based OptimizationSelection AlgorithmsSimulated AnnealingSimulated Annealing Optimization
This paper proposes a binary adaptation of the recently proposed meta-heuristic, Equilibrium Optimizer (EO), called Discrete EO (DEO), to solve binary optimization problems. A U-shaped transfer function is used to map the continuous values of EO into the binary domain. To further improve the exploitation capability of DEO, Simulated Annealing (SA) is used as a local search procedure and the combination is named as DEOSA. The proposed DEOSA algorithm is applied to 18 well-known UCI datasets and compared with a wide range of algorithms. The results are statistically validated using Wilcoxon rank-sum test and Friedman test . In order to test the scalability and robustness of DEOSA, it is additionally tested over seven high-dimensional Microarray datasets and 25 binary Knapsack problems . The results evidently demonstrate the superiority and merits of DEOSA when solving binary optimization problems.
56
James Kennedy, R.C. Eberhart · 2002 · 47.5K citations
Optimization by Simulated Annealing
Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi · Science · 1983 · 44.6K citations
The Whale Optimization Algorithm
Seyedali Mirjalili, Andrew Lewis · Advances in Engineering Software · 2016 · 14K citations
GSA: A Gravitational Search Algorithm
Esmat Rashedi, Hossein Nezamabadi–pour, Saeı̈d Saryazdi · Information Sciences · 2009 · 7.3K citations