Algorithm 3: STOA

Input:$\mathrm{Population} \left({\overrightarrow{\mathrm{P}}}_{\mathrm{ST}}^{\mathrm{L}}\left(\mathrm{i}\right)\right)$ Output:$\mathrm{Best} \mathrm{SA} \left({\overrightarrow{\mathrm{P}}}_{\mathrm{BST}}^{\mathrm{L}}\left(\mathrm{i}\right)\right)$ $\mathrm{Initialize} ‘{\mathrm{M}}_{\mathrm{SA}}$$’ \mathrm{and} ‘{\mathrm{C}}_{\mathrm{B}}$’   Determine the fitness of every SA     $\mathrm{while} (\mathrm{i}<{\mathrm{Max}}_{\mathrm{Iter}}$) do       for every SA, do       Modify the locations of SAs using Equation (10)     end //for   $\mathrm{Update} ‘{\mathrm{S}}_{\mathrm{A}}$$’ \mathrm{and} ‘{\mathrm{C}}_{\mathrm{Best}}$’   Find the fitness of every SA $\mathrm{Modify} ‘{\overrightarrow{\mathrm{P}}}_{\mathrm{BST}}^{\mathrm{L}}\left(\mathrm{i}\right)$’ in case there is an improved solution compared to a former ideal solution $\mathrm{i}=\mathrm{i}+1$ $\mathrm{return}\left({\overrightarrow{\mathrm{P}}}_{\mathrm{BST}}^{\mathrm{L}}\left(\mathrm{i}\right)\right)$ End