introduction to differential evolution

Introduction to Differential Evolution Rajib Kumar Bhattacharjya - PowerPoint PPT Presentation

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


  1. Introduction to Differential Evolution Rajib Kumar Bhattacharjya Department of Civil Engineering Indian Institute of Technology Guwahtai

  2. 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

  3. 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, … 𝑂

  4. 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 𝑦 𝑗

  5. 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

  6. 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

  7. 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