Algorithm 1. Particle swarm optimization.

input: D (search space), f (objective function)

output: g (swarm’s best known location)

hyperparameters: swarmsize, maxiter, minfunc, ω, ϕp, ϕg

begin

let $swarm\leftarrow generateSwarm(swar{m}_{size})$;

for each particle ∈ swarm do set its location as the best known position;

let $g\leftarrow argmi{n}_{p}f(p)$ p: each particle’s best known position

for $i\leftarrow 1$ to maxiter do

for particle ∈ swarm do

let x, v, p as the particle’s position, current velocity, best known position;

let $r_p,r_g\leftarrow random(0,1)$;

$v\leftarrow \omega v+r_p{\varphi }_p(p-x)+r_g{\varphi }_g(g-x)$;

$x\leftarrow x+v$;

if f(x) < f(p) then $p\leftarrow x$;

end

$g\leftarrow argmi{n}_{p}f(p)$;

end

end