Journal
ENGINEERING WITH COMPUTERS
Volume 38, Issue SUPPL 5, Pages 3927-3949Publisher
SPRINGER
DOI: 10.1007/s00366-020-01252-z
Keywords
Salp Swarm Algorithm; Gaussian mutation; Levy-flight mutation; Cauchy mutation
Ask authors/readers for more resources
Different versions of the SSA employing various mutation schemes were proposed in this study to enhance the optimization process for complex problems. The Gaussian mutation proved to be particularly effective in boosting the algorithm's exploration and exploitation abilities.
Salp Swarm Algorithm (SSA) is a recent metaheuristic algorithm developed from the inspiration of salps' swarming behavior and characterized by a simple search mechanism with few handling parameters. However, in solving complex optimization problems, the SSA may suffer from the slow convergence rate and a trend of falling into sub-optimal solutions. To overcome these shortcomings, in this study, versions of the SSA by employing Gaussian, Cauchy, and levy-flight mutation schemes are proposed. The Gaussian mutation is used to enhance neighborhood-informed ability. The Cauchy mutation is used to generate large steps of mutation to increase the global search ability. The levy-flight mutation is used to increase the randomness of salps during the search. These versions are tested on 23 standard benchmark problems using statistical and convergence curves investigations, and the best-performed optimizer is compared with some other state-of-the-art algorithms. The experiments demonstrate the impact of mutation schemes, especially Gaussian mutation, in boosting the exploitation and exploration abilities.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available