Introduction to Differential Evolution Rajib Kumar Bhattacharjya Department of Civil Engineering Indian Institute of Technology Guwahtai
Differential Evolution It is a stochastic, population-based optimization algorithm for solving nonlinear optimization problem The algorithm was introduced by Storn and Price in 1996 Consider an optimization problem Minimize π π Where π = π¦ 1 , π¦ 2 , π¦ 3 , β¦ , π¦ πΈ , πΈ is the number of variables
Evolutionary algorithms Initialize Mutation Recombination Selection population Termination Next Generation Criteria This is a population based algorithm Yes No Consider a population size of π Optimal Solution The population matrix can be shown as π = π¦ π,1 π , π¦ π,2 π , π¦ π,3 π , β¦ , π¦ π,πΈ π π¦ π,π Where, π is the Generation and π = 1,2,3, β¦ π
Initial population Initial population is generated randomly between upper lower and upper bound π + π πππ π β π¦ π,π π π = 1,2,3, β¦ π π¦ π,π = π¦ π,π β π¦ π,π π = 1,2,3, β¦ πΈ and π is the lower bound of the variable π¦ π Where π¦ π π is the upper bound of the variable π¦ π Where π¦ π
Mutation π , π¦ π 2π π π From each parameter vector, select three other vectors π¦ π 1π and π¦ π 3π randomly. Add the weighted difference of two of the vectors to the third π+1 = π¦ π 1π π π π π€ π + πΊ π¦ π 2π β π¦ π 3π π+1 is called donor vector π€ π πΊ is generally taken between 0 and 1
Recombination π+1 is developed from the target vector, π¦ π,π π , and the donor vector, A trial vector π£ π,π π+1 π€ π,π π+1 π = 1,2,3, β¦ πΈ and π€ π,π ππ π πππ() β€ π· π ππ π = π½ π πππ π+1 = π£ π,π π π¦ π,π ππ π πππ() > π· π πππ π β π½ π πππ π = 1,2,3, β¦ π π½ π πππ is a integer random number between [1,D] π· π is the recombination probability
Selection π is compared with the trial vector π£ π,π π+1 and the one with the The target vector π¦ π,π lowest function value is selected for the next generation π+1 < π π¦ π π+1 π π+1 = π£ π,π ππ π π£ π π¦ π π π¦ π ππ’βππ π₯ππ‘π π = 1,2,3, β¦ π
Recommend
More recommend