Power Transmission Network Optimization Strategy Based on Random Fractal Beetle Antenna Algorithm
Algorithm 1
General steps of the search process in MHS algorithms.
(1)
Begin (initialization)
(2)
P: Create the P-population
(3)
for i = 1: n (the number of solution candidates)
(4)
F: calculate the fitness values of members in P
(5)
end
(6)
while (search process lifecycle)
(7)
Step 1: guide selection mechanism (create a mating pool) selection of reference positions from the P by using guide selection methods (“fitness distance balance, FDB,” greedy, randomly, and roulette wheel)
(8)
Step 2: search operators:
(9)
Exploitation (neighborhood search around reference positions)
(10)
Exploration (diversification operations in P)
(11)
Step 3: update mechanism: update the P-population depending on the fitness values of solution candidates or the NSM (natural survivor method)-scores [25] of them
