Search

A recently developed metaheuristic optimization algorithm, Salp Swarm Algorithm (SSA), has manifested its capability in solving various optimization problems and many real-life applications. SSA is based on salps' swarming behaviour when finding their way and searching for food in the oceans. Nonetheless, like most metaheuristic algorithms, SSA experiences low convergence and stagnation in local optima and rate. There is a need to enhance SSA to speed its convergence and effectiveness to solve complex problems. In the present study, we will introduce chaos into SSA (CSSA) to increase its global search mobility for robust global optimization. Detailed studies are carried out on real-world nonlinear benchmark systems and CEC 2013 benchmark functions with chaotic map (Tent). Here, the algorithm utilizes a Tent map to tune the salp leaders' attractive movement around food sources. The experimental results, considering both convergence and accuracy simultaneously, demonstrate the effectiveness of CSSA for 12 nonlinear systems and 28 unconstrained optimization problems CEC 2013. Two nonparametric statistical tests, the Friedman test and Wilcoxon Signed-Rank Test, are conducted to show the superiority of CSCA over other states of the art algorithms and our results' significance. • This paper introduces chaos into Salp Swarm Algorithm. • Solve 28 unconstrained optimization problems, CEC and 12 nonlinear systems. • The effectiveness and efficiency of our algorithm are provided. • Experimental results prove superiority of our algorithm over the state-of-the-arts. [ABSTRACT FROM AUTHOR]