Fig 1.
ForI ≠ 0, the different cases of the solution.
Fig 2.
The flowchart of LSLI.
Fig 3.
Selection of the exemplar dimensions for particle i.
(a)CLPSO (b)CLPSO-LIL.
Fig 4.
The flowchart of LILPSO.
Table 1.
Details of benchmarks.
Table 2.
Iterative forms of each algorithms.
Table 3.
Results for D = 10, N = 50, FEs = 100,000.
Table 4.
Results for D = 10, N = 50, FEs = 100,000.
Table 5.
Results for D = 30, N = 40, FEs = 200,000.
Table 6.
Results for D = 30, N = 40, FEs = 200,000.
Table 7.
results for D = 50, N = 100, FEs = 500,000.
Table 8.
results for D = 50, N = 100, FEs = 500,000.
Fig 5.
The comparison on convergence.
(a) Sphere (b) Rosenbrock (c) Noise Quadric (d) Penalized (e) Griewank (f) Schwefel.
Table 9.
PID Results optimized by some algorithms.