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

Algorithm 1

Create the first population.

For each individual:

  Compute the value of the fitness function.

While the stop criterion is not satisfied:

  For each individual from the population:

   Compute the number of seeds.

   For each seed:

     Draw the dissemination method

    (dispersing, spreading or rolling down).

     Create a new individual according to the chosen method.

     Compute the value of its fitness function.

  Select individuals for a new population.

Return the best individual.