Application of mutation operators to salp swarm algorithm

Abstract

Salp swarm algorithm (SSA) based on the swarming behaviour of salps found in ocean, is a very competitive algorithm and has proved its worth as an excellent problem optimizer. Though SSA is a very challenging algorithm but it suffers from the problem of poor exploitation, local optima stagnation and unbalanced exploration and exploitation operations. Thus in order to mitigate these problems and improve the working properties, seven new versions of SSA are proposed in present work. All the new versions employ new set of mutation properties along with some common properties. The common properties of all the algorithms include division of generations, adaptive switching and adaptive population strategy. Overall, the proposed algorithms are self-adaptive in nature along with some added mutation properties. For performance evaluation, the proposed algorithms are subjected to variable initial population and dimension sizes. The best among the proposed is then tested on CEC 2005, CEC 2015 benchmark problems and real world problems from CEC 2011 benchmarks. Experimental and statistical results show that the proposed mutation clock SSA (MSSA) is best among all the algorithms under comparison.