Algorithm 1 Lévy Flight Improved Tree–Seed Algorithm (LTSA)

1. Initialization algorithm Generate N random trees in the D-dimensional search space by using the formula;  Calculate the position of the tree according to the problem objective function;  Choose the optimal solution according to the formula.

2. Search for torrentsDetermine the number of seeds this tree produces;  Each dimension of the FOR seed;  Update this dimension according to the formula;  Choose the best seed and compare it with this lesson tree;  If the seed is in a better position than the tree, replace the tree with the seed. 3. Select the optimal solution in the population  If the newly generated optimal solution is better than the previous optimal solution, the new optimal solution and its corresponding tree are generated.;  Or replace the original optimal solution and the corresponding tree. 4. Check whether the iteration termination condition is meet  If not satisfied, go back to Step2. 5. Output the optimal solution