Differential Evolution Algorithm with Self-Adaptive Population Resizing Mechanism

Algorithm 1

Differential evolution algorithm.

(1): Begin

(2):  Initialization(); Generate uniformly distributed random population of NP individuals

(3):  while stopping criterion is not satisfied do

(4):   for  𝑖=1 to NP do

(5):    Select random indexes 𝑟₁,𝑟₂,𝑟₃𝑤𝑖𝑡ℎ𝑟₁≠𝑟₂≠𝑟₃≠𝑖

(6):    𝑉^→𝐺_𝑖=𝑋^→𝐺_𝑟1+𝐹⋅(𝑋^→𝐺_𝑟2−𝑋^→𝐺_𝑟3)

(7):    𝑗_rand=[rand[0,1)∗𝐷]

(8):    for 𝑗=1 to 𝐷  do

(9):     if  rand_𝑖,𝑗[0,1]≤𝐶_𝑟𝑜𝑟𝑗=𝑗_rand  then

(10):      𝑢^𝐺_𝑖,𝑗=𝑣^𝐺_𝑖,𝑗

(11):     else

(12):      𝑢^𝐺_𝑖,𝑗=𝑥^𝐺_𝑖,𝑗

(13):     end if

(14):    end for

(15):    if 𝑓(𝑈^→𝐺_𝑖)≤𝑓(𝑋^→𝐺_𝑖)  then

(16):     𝑋^→_𝑖^𝐺+1=𝑈^→𝐺_𝑖

(17):    else

(18):     𝑋^→_𝑖^𝐺+1=𝑋^→𝐺_𝑖

(19):    end if

(20):   end for

(21):   G = G + 1

(22):  end while

(23): End