Algorithm 1 LRDE_IWO algorithm

Input: Population size $N$, the maximum number of iterations $T$, the exploration iteration ratio $\phi$ and other parameters. Output: Global optimal solution $g_{best}$.

1. for t = 1 to T do

2. Calculate the maximum fitness value of the population

$f_{\max }$ and minimum fitness value $f_{\min }$

3. The standard deviation of this iteration is calculated

according to Equation (8)

4. for each individual weed do

5. Determine the number of seeds produced by each

weed according to Equation (6)

6. Seeds produced by random allocation

7. The fitness of seeds was calculated

8. $\mathbf{if}rand<0.5-0.5t/(\phi \ast T)\mathbf{then}$

9. Update the individual position according to

Equation (10)

10. else

11. Update the individual position according to

Equation (15)

12. end if

13. Greedily select the current optimal individual

according to the fitness value

14. end for

15. The populations were merged and sorted by fitness

value

16. The top 40% of the excellent individuals were selected

for differential evolution according to Formulas (16)–(18)

17. Greedy selection of the above individuals according to

fitness values

18. Update global optimal solution $g_{best}$

end for