Table 1

Pseudocode for the proposed algorithm [43].

Algorithm 1: Pseudocode for EDBO Algorithm
Input: DB, iteration number
Output: The selection of optimal parameters for the optimization approach
Set the DB population k = 1, 2, 3, O and define its relevant parameters
While (t ≤ Tmax) do
for k = 1 to O do
if k == BRDB then
δ = rand (1);
If <0.9 then
Select α value
Update the BRDB;
Else
Update the BRDB;
end if
end if
If k == BrB then
Update the BrB position;
end if
if k == SDB then
Update egg-laying locations and foraging locations of BrB and SDB using spiral search strategy;
end if
If k==th then
Update position of Thief Dung Beetle (TDB) by Levy flight strategy;
end if
end for
If a better position is obtained than before then update it;
end if
it = it + 1
end while
Return the best value

O” represents the population size of the particles, “α” represents the deflection coefficient, “it” represents the present iteration, δ signifies searching agent, Max_iter represents the maximum iteration number, best fitness value is denoted as fbest, fi denotes the fitness at the kth solution, the thief is expressed as th, Small Dung Beetle is denoted as SDB, Brood Ball is denoted as BrB, BRDB denotes the Ball Rolling Dung Beetle.

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.