An Adaptive Bacterial Foraging Optimization Algorithm with Lifecycle and Social Learning

Pseudocode 2

Pseudocode of BFOLS algorithm.

1 Initialization

2 While (termination conditions are not met)

3  𝑆= size of the last population; 𝑖=0;

4  while  𝑖<𝑆

5   𝑖=𝑖+1;

6   𝐽last=𝐽(𝑖)

7   Generate a tumble angle for bacterium 𝑛;

8   Update the position of bacterium 𝑛 by (2.1);

9   Recalculate the 𝐽(𝑖)

10   Update personal best and global best;

11    𝑚=0

12    While (𝑚<𝑁_𝑠)

13    If  𝐽(𝑖)<𝐽last

14     𝐽last=𝐽(𝑖)

15     Run one more step using (2.1);

16     Recalculate the 𝐽(𝑖);

17     Update personal best and global best;

18     𝑚=𝑚+1;

19    Else

20     𝑚=𝑁_𝑠;

21    End if

22    End while

23    If (Nutrition (𝑖) is larger than split threshold value)

24    Split bacterium 𝑖 into two bacteria; Break;

25    End if

26    If (Nutrition (𝑖) is less than dead threshold value)

27    Remove it from the population;

28    𝑖=𝑖−1; 𝑆=𝑆−1; Break;

29    End if

30    If (Nutrition (𝑖) is less than 0 and rand<𝑃_𝑒 )

31    Move bacterium 𝑖 to a random position;

32    End if

33   End while

34 End while