Algorithm 1.

“hybrid (PSO + TRR) + TRR” optimization approach.

for itPSO < L do

for i < N do

${\overrightarrow{v}}_i\leftarrow \mathrm{\chi }\left({\overrightarrow{v}}_i+\overrightarrow{U}\left(0,{\varphi }_1\right)\otimes \left({\overrightarrow{b}}_i-{\overrightarrow{p}}_i\right)+\overrightarrow{U}\left(0,{\varphi }_2\right)\otimes \left({\overrightarrow{b}}_g-{\overrightarrow{p}}_i\right)\right)$

${\overrightarrow{\tilde{p}}}_i\leftarrow {\overrightarrow{p}}_i+{\overrightarrow{v}}_i$

enforce boundary constraints on ${\overrightarrow{\tilde{p}}}_i$

for itTRR < K do

perform TRR iteration on ${\overrightarrow{\tilde{p}}}_i$

end for

${\overrightarrow{v}}_i\leftarrow {\overrightarrow{\tilde{p}}}_i-{\overrightarrow{p}}_i$

${\overrightarrow{p}}_i\leftarrow {\overrightarrow{p}}_i+{\overrightarrow{v}}_i$

end for

end for

sort $\overrightarrow{b}[]$ by ascending squared error

for i < M do

while (not converged) ∧ (itTRR < maxTRR) do

perform TRR iteration on ${\overrightarrow{b}}_i$

end while

end for