Search

The Competitive Swarm Optimizer (CSO) has emerged as a prominent technique for solving intricate optimization problems by updating only half of the population in each iteration. Despite its effectiveness, the CSO algorithm often exhibits a slow convergence rate and a tendency to become trapped in local optimal solutions, as is common among metaheuristic algorithms. To address these challenges, this paper proposes a hybrid approach combining the CSO with the Salp Swarm algorithm (SSA), CL-SSA, to increase the convergence rate and enhance search space exploration. The proposed approach involves a two-step process. In the first step, a pairwise competition mechanism is introduced to segregate the solutions into winners and losers. The winning population is updated through strong exploitation using the SSA algorithm. In the second step, non-winning solutions learn from the winners, achieving a balance between exploration and exploitation. The performance of the CL-SSA is evaluated on various benchmark functions, including the CEC2017 benchmark with dimensions 50 and 100, the CEC2008lsgo benchmark with dimensions 200, 500 and 1000, as well as a set of seven well-known constrained design challenges in various engineering domains defined in the CEC2020 conference. The CL-SSA is compared to other metaheuristics and advanced algorithms, and its results are analyzed through statistical tests such as the Friedman and Wilcoxon rank-sum tests. The statistical analysis demonstrates that the CL-SSA algorithm exhibits improved exploitation, exploration, and convergence patterns compared to other algorithms, including SSA and CSO, as well as popular algorithms. Furthermore, the proposed hybrid approach performs better in solving most test functions. [ABSTRACT FROM AUTHOR]

Salp swarm algorithm (SSA) is a unique swarm intelligent algorithm widely used for various practical applications due to its simple framework and good optimization performance. However, like other swarm-based algorithms, SSA yields local optimal solutions and has a slow convergence rate and low solution accuracy when dealing with high-dimensional global optimization problems. Based on quadratic interpolation and a local escape operator (LEO), a salp swarm optimization algorithm (QSSALEO) is proposed to address these issues. Quadratic interpolation around the best search agent aids QSSALEO's exploitation ability and solution accuracy, whereas the local escaping operator employs random operators to escape local optima. These tactics complement one another to help SSA promote convergence performance. Furthermore, the algorithm strives for a balance of exploitation and exploration. The proposed QSSALEO method was tested using the CEC 2017 benchmark with 50 and 100 decision variables, as well as seven CEC2008lsgo test functions with 200, 500, and 1000 decision variables, and its performance was compared to that of other metaheuristic algorithms and advanced algorithms, including seven salp swarm variants. The experimental results reveal that QSSALEO outperforms SSA and other population-based algorithms regarding convergence rate and solution correctness. The QSSALEO was then evaluated as a feature selection algorithm on 19 datasets (including three high-dimensional datasets). Friedman and Wilcoxon rank-sum statistical tests are also used to analyze the results. According to experimental data and statistical tests, the QSSALEO algorithm is very competitive and often superior to the algorithms employed in research. Therefore, the proposed method can also be considered a specialized large-scale global optimization optimizer whose performance surpasses state-of-the-art algorithms such as CMA-ES and SHADE. The algorithm source code is available at https://github.com/MohammedQaraad/An-Innovative-Quadratic-interpolation-Salp-Swarm. [ABSTRACT FROM AUTHOR]

Salp swarm algorithm (SSA) is a recently developed meta-heuristic swarm intelligence optimization algorithm based on simulating the chain movement behavior of salps sailing and foraging in the sea. In this paper, a novel hybrid meta-heuristic algorithm called SSA-FGWO is proposed to overcome the shortcomings of the original SSA, including slow convergence speed in dealing with high-dimensional and multimodal landscapes, low precision, and global optimization problems. The essential idea of SSA-FGWO is to improve the salp swarm optimization algorithm (SSA) by utilizing the Grey Wolf Algorithm (GWO) strategy. The hybridization mechanism includes two steps: First, the strong exploitation of SSA is applied to update the leaders' position of the chain population. Second, the strong exploration strategy of GWO is used to update the followers' position to increase the population variance of the proposed optimizer. The proposed algorithm is expected to enhance exploration and exploitation ability significantly by the hybrid design. The effectiveness of SSA-FGWO is investigated through CEC2020, 23 representative benchmark cases, and feature selection problems (18 data sets) are solved. The algorithm has been examined for its computational complexity and convergent behavior. In addition to GWO, SSA and other swarm optimization algorithms are employed to compare with the proposed optimizer. The obtained experimental results show that the exploitation, exploration tendencies, and convergence patterns of SSA-FGWO have significantly improved. The results show that the proposed SSA-FGWO algorithm is a promising one that outperforms the basic SSA, GWO, and other algorithms in terms of efficacy. [ABSTRACT FROM AUTHOR]

The Particle Swarm Optimization technique (PSO) is widely used in practical applications due to its flexibility and strong optimization performance. However, like other metaheuristic algorithms, PSO has limitations, such as a propensity to become trapped in local minima and an uneven distribution of effort between exploration and exploitation stages. A novel local search technique called QPSOL, based on PSO is the proposed solution to mitigate these issues. QPSOL aims to increase diversity and achieve a closer balance between the exploration and exploitation phases. The QPSOL incorporates a dynamic optimization strategy to enhance the method's efficiency. Unlike the novel local search strategy, which uses a new local search approach (LSA) to break out of local optima, QPSOL employs quadratic interpolation around the optimal search agent to enhance its exploitation capability and solution accuracy. These strategies complement each other and contribute to boosting PSO's convergence efficiency while seeking to balance exploration and exploitation. The proposed method is assessed using the IEEE CEC'2021 test suite, and its efficacy is evaluated against other metaheuristics and cutting-edge algorithms to determine its trustworthiness. The optimal parameters of three PV models are determined using the proposed technique and compared to different well-established algorithms. Systematic comparisons show that QPSOL is competitive with, and often outperforms, commonly used methods in research for predicting model parameters. [ABSTRACT FROM AUTHOR]