Salp swarm Algorithm

1
A Novel swarm based Metaheuristic optimization
Salp Swarm Algorithm

• Salp swarm algorithm (SSA) mimics the swarming
  behavior of salps. Its barrel shaped bodies
  similar to jelly fishes, in which water is pumped
  through body as propulsion to shift forward.
• In deep ocean salps are often appeared as a
  flock called salp chain.
• This salp chains classified in to two group such
  as leader and follower.
• The leader in the salp is present in front of
  the chain and remaining all salps are followers.

2
Salp Swarm Chain
3
Mathematical Model Salp Swarm Algorithm

• The mathematical model is the position of the
  salp is defined in an n-dimensional search space
  where n is the number of variables in a given
  problem.
• Positions of all the salps are stored in a two-
  dimensional matrix called y.
• it is also assumed that there is a food source
  called f in the search space as the swarms
  target.
• In order to leader update the position of the
  leader the following equation is expressed as

4
Conti.
(3.1)
Where
shows the position of first salp in nth
dimension. position of the food source in
the nth dimension. upper bound of the nth
dimension. lower bound of the nth
dimension. , are random
numbers. The coefficient is balance the
exploration and exploitation.
(3.2)
Where l current iteration and L
maximum number of iteration are
random numbers un uniformly generated in
interval of 0,1.
5
Conti.
To update the position of the followers (
Newtons law of motion) is utilized and it is
expressed as follows
(3.3)
Where i 2, shows the position of the ith
follower in nth dimension.
t is time. Initial speed
and
(3.4)
Because the time in optimization is iteration.
The discrepancy between iteration is equal to
1and considering 0 and this expression as
follows
Where i 2, shows the position of the ith
follower in nth dimension. with Equations.
(3.1) (3.4) , the salp chain can be simulated
6
Pseudo code of the SSA Algorithm