Algorithm 1. The pseudocode of JS

Inputs: number of search agents ($N$), number of iterations ($m_i$), initial value of chaotic map (${LV}_0$), problem dimension ($d$), and lower ($LB$) and upper ($UB$) boundaries of search space

Outputs: the best jellyfish ($X_B$) and its fitness ($F_B$)

// Swarm generation

$i=1$

while ($i\le N$)

Initialize $X_i$ using Equation (1)

Calculate $F_i$

$i=i+1$

end while

Find $X_B$ and $F_B$

$c_i=1$

while ($c_i\le m_i$)

$i=1$

while ($i\le N$)

Compute $c$ using Equation (3)

if ($c\ge c_0$)

// Ocean current

Update $X_i$ using Equation (4)

else

if ($r\ge 1-c$)

// Passive motion

Update $X_i$ using Equation (13)

else

// Active motion

Calculate $step$ by Equation (15)

Update $X_i$ using Equation (14)

end if

end if

Update $F_i$

$i=i+1$

end for

Update $X_B$ and $F_B$

$c_i=c_i+1$

end while

Return $X_B$ and $F_B$