Figure 2

Overview of the three main stages of the DE algorithm. (a) Mutation: each entry of the candidate solution vector is mutated, generating a new mutated candidate solution vector; (b) Crossover: a new candidate solution vector is created with entries from the original and the newly created mutated vector; (c) Selection: the new and the original candidate solution vector are tested against the cost function and the one with the best results is propagated for the next generation