An Adaptive Bacterial Foraging Optimization Algorithm with Lifecycle and Social Learning

Pseudocode 1

Pseudocode of original BFO algorithm.

1 Initialization

2 For  𝑖=1: 𝑁_ed

3  For  𝑗=1: 𝑁_re

4   For  𝑘=1: 𝑁_𝑐

5    For  𝑛=1: 𝑆

6     𝐽last=𝐽(𝑛)

7     Generate a tumble angle for bacterium 𝑛;

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

9     Recalculate the 𝐽(𝑛)

10      𝑚=0

11      While (𝑚<𝑁_𝑠)

12      If  𝐽(𝑛)<𝐽last

13       𝐽last=𝐽(𝑛);

14       Run one more step using (2.1);

15       Recalculate the 𝐽(𝑛);

16       𝑚=𝑚+1;

17      Else

18       𝑚=𝑁_𝑠;

19      End if

20      End while

21     End for

22    Update the best value achieved so far;

23    End for

24   Sort the population according to 𝐽;

25    For  𝑚=1: 𝑆/2

26    Bacterium (𝑘+𝑆/2) = Bacterium (𝑘);

27    End For

28   End for

29   For 𝑙=1: 𝑆

30   If ( rand<𝑃_𝑒 )

31    Move Bacterium 𝑙 to a random position

32   End if

33   End for

34 End for