A Hybrid Evolutionary Algorithm for Wheat Blending Problem

Algorithm 3

input: 𝑛, 𝑝_𝑚, 𝑝_𝑙

output: 𝑡_{𝑏𝑒𝑠𝑡}

SEARCH_SPACE_REDUCTION()

𝑡_{𝑖𝑛𝑖𝑡}= INITIALIZE()

𝑡_{𝑏𝑒𝑠𝑡}=𝑡_{𝑖𝑛𝑖𝑡}

While   none of termination condition was met

  𝑡_{𝑏𝑎𝑠𝑒} = 𝑡_{𝑏𝑒𝑠𝑡}

  for  𝑖=1∶𝑛

   𝑡_{𝑛𝑒𝑤1} = MUTATE(𝑡_{𝑏𝑎𝑠𝑒})

   𝑟 = RANDOM(0,1)

   while  𝑟<𝑝_𝑚

     𝑡_{𝑛𝑒𝑤1} = MUTATE(𝑡_{𝑛𝑒𝑤1})

     𝑟 = RANDOM(0,1)

   end  while

   𝑡_{𝑛𝑒𝑤2} = ROUND(SIMPLEX(𝑡_{𝑛𝑒𝑤1}, GET_SPLIT(𝑡_{𝑛𝑒𝑤1})))

   𝑟 = RANDOM(0,1)

   if  𝑟<𝑝_𝑙  and  𝑡_{𝑛𝑒𝑤2}  is  feasible

   𝑡_{𝑛𝑒𝑤2}  =  LOCAL_SEARCH(𝑡_{𝑛𝑒𝑤2})

   end if

   if  𝑡_{𝑛𝑒𝑤2}  is better than  𝑡_{𝑏𝑒𝑠𝑡}

   𝑡_{𝑏𝑒𝑠𝑡}=𝑡_{𝑛𝑒𝑤2}

   end if

  end for

  𝑡_{𝑏𝑒𝑠𝑡} = LOCAL_SEARCH_ALL(𝑡_{𝑏𝑒𝑠𝑡})

end while