Skip to main content
. 2021 Jul 8;23(7):874. doi: 10.3390/e23070874
Algorithm 2 PSO
  • Input: the parameters M, N, δ, c1 and c2

  • Begin

  • S1: initialize xi(t) and vi(t) randomly, 0<iM, iterative times t = 1;

  • S2: compute f(i) ,0<iM, update pi(t) and pg(t), if it satisfies (t > N or precision δ), then go to step S4; otherwise, go to step S3;

  • S3: update xi(t) and vi(t) according to Equation (1), iterative times t = t + 1; go to step S2;

  • S4: output the optimized results.

  • End