The Expanded Invasive Weed Optimization Metaheuristic for Solving Continuous and Discrete Optimization Problems

Algorithm 4

/* Rolling down */

𝐼≔ current point in the search space.

For the given number of moves:

 For the given number of neighbours:

  Perform a single transformation of 𝐼 creating his neighbour.

  Compute the value of the neighbour’s fitness function.

 𝐼≔ the best neighbour.

Return 𝐼.