| 查看: 276 | 回复: 0 | ||
[求助]
有关鱼群算法流程的文献，有几句不是很懂，求虫友指导
|
|
1 To generate initialization groups: set the initial bulletin board iterations which record the best state of artificial fish not changed or changed little: Beststep←0, the initial number of iterations Num. ← 0, N which represents the number of artificial fish is randomly generated under controlling. 2 To calculate initial value on bulletin board: calculate the initial the artificial f  ish value in the initial fish swarm,，and compare the value, take Y as the minimum to enter the bulletin board, this fish is assigned to the bulletin board.3 To choices behavior: the artificial fish respectively Simulates rear-end behavior and clusters behavior, comparing the value, the smaller Y was selected, the acts accordingly are implemented, the default behavior is foraging behavior. 4 Bulletin board: after each operation, testing their value among them, if superior, replace it, and set Beststep←0. 5 Mutation of conditional: if the number of the value Beststep do not change reached the maximum threshold maxbest consecutively, the implementation goes to step (6); otherwise go to step (7). 6 Mutation operation: In addition to the fish in the best individual outside bulletin board, all other artificial fish follows these steps. 6.1The dimension of all the various artificial fish generates random numbers r∈(0,1)，is mutation probability. The dimension of the individual is randomly initialized; otherwise the dimensions of the artificial fish remain the same. 6.2 To calculate the value Y of the formation of new artificial fish, and to compare with the optimal value on the bulletin board, if better than the bulletin board, the new artificial replaces it. 6.3 To set Beststep←0. 7 Termination of conditional: if Num has reached the preset maximum number of iterations maxnumber or the optimal solution is satisfactory within the error bounds|y_n-y_(n+1) |<ε,ε>0 is a very small positive number, if not met, then Num← Num+1,Beststep←Beststep+ 1, go to step (3)，the next fish swarm optimization process begins; otherwise goes to step (8). 8 To terminate the algorithm, output the optimal solution. |
回复此楼» 猜你喜欢
售一区SCI文章T0P，我:8O.551.O54,科目全,可十急
已经有9人回复
-
售SCI-T0P文章，我:8O.5.5.1.O.54,科目齐全,可+急
已经有3人回复
-
考博求助
已经有3人回复
-
售SCI一区文章，我:8.O.551.O.5.4,科目全,可伽急
已经有5人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.5.4,科目全,可+急
已经有4人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.5.4,科目全,可+急
已经有5人回复
-
售SCI-T0P文章，我:8O.5.5.1.O.54,科目齐全,可+急
已经有9人回复
-
售一区SCI文章T0P，我:8O.551.O54,科目全,可十急
已经有9人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.5.4,科目全,可+急
已经有10人回复
-
售SCI一区文章，我:8.O.551.O.5.4,科目全,可伽急
已经有6人回复
