Competitive Swarm Optimizer Based Gateway Deployment Algorithm in Cyber-Physical Systems

. 2017 Jan 22;17(1):209. doi: 10.3390/s17010209

Algorithm 1 The Competitive Swarm Optimizer Algorithm

1:
Initialize $P (0), M a x g e n$ ; // $P (t)$ is the swarm ingeneration t, $M a x g e n$ is the maximum number of iterations.
2:
for $t = 1$ to $M a x g e n$ do
3:
calculate the fitness of all particles in $P (t)$ ;
4:
$L = P (t), P (t + 1) = \emptyset;$ //L denotes a set of particles that have not yet participated in a competition.
5:
while $L \neq \emptyset$ do
6:
randomly choose two particles $X_{1} (t), X_{2} (t)$
7:
if $f (X_{1} (t)) \leq f (X_{2} (t))$ then// $f (X_{1} (t))$ is the fitness function for $X_{1} (t)$
8:
$X_{w} (t) = X_{1} (t), X_{l} (t) = X_{2} (t)$ ; // $X_{w} (t)$ is the winner particle in generation t, and $X_{l} (t)$ is the loser particle in generation t
9:
else
10:
$X_{w} (t) = X_{2} (t), X_{l} (t) = X_{1} (t);$
11:
end if
12:
add $X_{w} (t)$ into $P (t + 1)$ ;
13:
update $X_{l} (t)$ using (1) and (2)
14:
add the updated $X_{l} (t)$ into $P (t + 1)$ ;
15:
remove $X_{1} (t), X_{2} (t)$ from L
16:
end while
17:
end for