Algorithm 2 Enhanced PSO Algorithm 1:...

Algorithm 2

Enhanced PSO Algorithm

Set the initial value of swarm size SS(N), acceleration constants c₁ and c2, wmax, wmtn, vmax and maxiter.

Randomly initialize the population as x using Eq. (9) for each solution and the velocity vectors v as D dimensional zero vectors as in Eq. (10).

Set t := 0. {Counter initialization}

$w = w_{\max} - t \cdot (\frac{w_{\max} - w_{\min}}{\max_i t e r})$

Evaluate the fitness function for each of the solutions using f(xi) (Eq. (2)) and assign the values for Pbest and gbest.

for(i = l; i < SS; i ++) do

$v_{i}^{(t + 1)} = w v_{i}^{(t)} + c_{1} r_{i 1} \cdot (P b e s t_{i} (t) - x_{i}^{(t)}) + c_{2} r_{i 2} \cdot (g b e s t - x_{i}^{(t)})$

end for{Update the velocities of Particles}

for(i= l; i < SS, i + +) do

10:

for(j = 1; j <D;j + +) do

11:

if(v(i,j) > vmax) then

12:

v(i,j) = vmax

13:

end if

14:

if(v(i, j)< -vmax) then

15:

v(i, j) = −vmax

16:

end if

17:

$S = \frac{1}{1 + e^{- v (i j)}}$

18:

if(rand < s) then

19:

x(i, j) = 1

20:

else

21:

x(i,j)=0

22:

end if

23:

end for

24:

end for

25:

t = t +1 {Iteration counter is increasing}

26:

until(t <mox iter) {Termination criteria are satisfied}.

27:

Produce the best solution gbest.

[ViewLarge]

1:	Set the initial value of swarm size SS(N), acceleration constants c₁ and c2, wmax, wmtn, vmax and maxiter.
2:	Randomly initialize the population as x using Eq. (9) for each solution and the velocity vectors v as D dimensional zero vectors as in Eq. (10).
3:	Set t := 0. {Counter initialization}
4:	$w = w_{\max} - t \cdot (\frac{w_{\max} - w_{\min}}{\max_i t e r})$
5:	Evaluate the fitness function for each of the solutions using f(xi) (Eq. (2)) and assign the values for Pbest and gbest.
6:	for(i = l; i < SS; i ++) do
7:	$v_{i}^{(t + 1)} = w v_{i}^{(t)} + c_{1} r_{i 1} \cdot (P b e s t_{i} (t) - x_{i}^{(t)}) + c_{2} r_{i 2} \cdot (g b e s t - x_{i}^{(t)})$
8:	end for{Update the velocities of Particles}
9:	for(i= l; i < SS, i + +) do
10:	for(j = 1; j <D;j + +) do
11:	if(v(i,j) > vmax) then
12:	v(i,j) = vmax
13:	end if
14:	if(v(i, j)< -vmax) then
15:	v(i, j) = −vmax
16:	end if
17:	$S = \frac{1}{1 + e^{- v (i j)}}$
18:	if(rand < s) then
19:	x(i, j) = 1
20:	else
21:	x(i,j)=0
22:	end if
23:	end for
24:	end for
25:	t = t +1 {Iteration counter is increasing}
26:	until(t <mox iter) {Termination criteria are satisfied}.
27:	Produce the best solution gbest.

Sharing Unavailable