“…The search-space is explored through four main equations, which are chosen via biased chance x n, g t + 1 = x n, g t + rw (14) x n, g t + 1 = x n, g t + rand ⋅ x * − x n, g t (15) x n, g t + 1 = x New (16) x n, g t + 1 = x n, g t + rand ⋅ X bests g − x n, g t + rw (17) An individual n, belonging to a group g can take: (i) a random walk rw by (14); (ii) a direct step towards best solution x * by (15); (iii) a completely new random position x New in search-space through (16); (iv) a combined step towards the best of its group X bests g pe, plus random step rw, by (17). As highlighted in Fig.…”