-
1.
Initialize weight matrix Wij with dimensions (N, M).
-
2.
Compute Euclidean distance between individuals to generate neighbor matrix B1, …, BN.
-
3.
For i = 1 to N:
-
4.
Generate initial flying fox individual xi.
-
5.
Evaluate the fitness Fi of individual xi.
-
6.
End.
-
7.
Initialize BSi, WSi, and SL.
-
8.
For i = 1 to N: #Iteration Using FFO Method.
-
9.
Compute norm N1 as the difference between Fi and BSi.
-
10.
Compute norm N2 as the difference between BSi and WSi.
-
11.
Determine the position of flying fox individual based on conditions P, Q, R.
-
12.
If condition P is satisfied:
-
13.
Randomly select two distinct individuals xa, xb from Bi.
-
14.
Generate a new individual y through xa and xb.
-
15.
Elseif condition Q is satisfied:
-
16.
Generate a new individual y by moving xi towards the direction of the optimal solution according to Formula (5).
-
17.
Elseif condition R is satisfied:
-
18.
Generate a new individual y by moving xi to another location to avoid suffocation according to Formulas (6) and (7).
-
19.
End.
-
20.
Update Bi and relevant information in the population.
-
21.
Perform suffocation judgment for flying foxes with the same fitness value. #Suffocate Flying Foxes
-
22.
If the randomly generated number is less than the suffocation probability pD:
-
23.
If the number of flying foxes gathered in the same area is even,
-
24.
generate 2 new flying fox individuals for replacement via Formula (8) or (9), with the probability of 0.5 for each method.
-
25.
Else
-
26.
perform the above operation on an even number of foxes, declare the remaining fox dead, and replace it with a new flying fox generated using Formula (8).
-
27.
End.
-
28.
End.
-
29.
Update relevant parameters in the population.
-
30.
End.
-
31.
If the maximum iteration count has not been reached: #Termination.
-
32.
Return to Line 8 and continue iteration.
-
33.
Else
-
34.
Terminate iteration and return the final result.
-
35.
End.