DifferentialEvolutionStrategy Enumeration

Specifies the strategy used to generate trial vectors in the differential evolution algorithm.

Definition

Namespace: Numerics.NET.Optimization
Assembly: Numerics.NET (in Numerics.NET.dll) Version: 9.1.0
C#
public enum DifferentialEvolutionStrategy

Members

Best1Bin0 DE/best/1/bin: Uses best solution with binomial crossover v = best + F * (r1 - r2)
Best1Exp1 DE/best/1/exp: Uses best solution with exponential crossover v = best + F * (r1 - r2)
Rand1Bin2 DE/rand/1/bin: Classical DE mutation with binomial crossover v = r1 + F * (r2 - r3)
Rand1Exp3 DE/rand/1/exp: Classical DE mutation with exponential crossover v = r1 + F * (r2 - r3)
Rand2Bin4 DE/rand/2/bin: Uses two difference vectors with binomial crossover v = r1 + F * (r2 - r3) + F * (r4 - r5)
Rand2Exp5 DE/rand/2/exp: Uses two difference vectors with exponential crossover v = r1 + F * (r2 - r3) + F * (r4 - r5)
Best2Bin6 DE/best/2/bin: Uses best solution and two differences with binomial crossover v = best + F * (r1 - r2) + F * (r3 - r4)
Best2Exp7 DE/best/2/exp: Uses best solution and two differences with exponential crossover v = best + F * (r1 - r2) + F * (r3 - r4)
RandToBest1Bin8 DE/rand-to-best/1/bin: Linear combination towards best with binomial crossover v = r1 + F * (best - r1) + F * (r2 - r3)
RandToBest1Exp9 DE/rand-to-best/1/exp: Linear combination towards best with exponential crossover v = r1 + F * (best - r1) + F * (r2 - r3)
CurrentToBest1Bin10 DE/current-to-best/1/bin: Linear combination from current towards best with binomial crossover v = current + F * (best - current) + F * (r1 - r2)
CurrentToBest1Exp11 DE/current-to-best/1/exp: Linear combination from current towards best with exponential crossover v = current + F * (best - current) + F * (r1 - r2)

See Also