1. Addressing constrained engineering problems and feature selection with a time-based leadership salp-based algorithm with competitive learning.
- Author
-
Qaraad, Mohammed, Amjad, Souad, Hussein, Nazar K., and Elhosseini, Mostafa A.
- Subjects
MACHINE learning ,FEATURE selection ,METAHEURISTIC algorithms ,STATISTICS ,EVOLUTIONARY algorithms ,LEADERSHIP ,REINFORCEMENT learning - Abstract
Like most metaheuristic algorithms, salp swarm algorithm (SSA) suffers from slow convergence and stagnation in the local optima. The study develops a novel Time-Based Leadership Salp-Based Competitive Learning (TBLSBCL) to address the SSA's flaws. The TBLSBCL presents a novel search technique to address population diversity, an imbalance between exploitation and exploration, and the SSA algorithm's premature convergence. Hybridization consists of two stages: First, a time-varying dynamic structure represents the SSA hierarchy of leaders and followers. This approach increases the number of leaders while decreasing the number of salp's followers linearly. Utilizing the effective exploitation of the SSA, the position of the population's leader is updated. Second, the competitive learning strategy is used to update the status of the followers by teaching them from the leaders. The goal of adjusting the salp swarm optimizer algorithm is to help the basic approach avoid premature convergence and quickly steer the search to the most promising likely search space. The proposed TBLSBCL method is tested using the CEC 2017 benchmark, feature selection problems for 19 datasets (including three high-dimensional datasets). The TBLSBCL was then evaluated using a benchmark set of seven wellknown constrained design challenges in diverse engineering fields defined in the benchmark set of real-world problems presented at the CEC 2020 conference (CEC 2020). In each experiment, TBLSBCL is compared with seven other state-of-the-art metaheuristics and other advanced algorithms that include seven variants of the salp swarm. Friedman and Wilcoxon rank-sum statistical tests are also used to examine the results. According to the experimental data and statistical tests, the TBLSBCL algorithm is very competitive and often superior to the algorithms employed in the studies. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF