scenarios searched by the PSO algorithm equals to the number of
population size multiplied by the number of maximum iteration,
which is equal to 40 25 = 1000. Therefore, the proposed optimization
approach leads to decrease the required computational
time significantly in comparison to a countless search and therefore,
ensures a saving of computational time.