Skip to main content
. 2020 Apr 6;20(7):2056. doi: 10.3390/s20072056
Algorithm 1α-step Algorithm

for int i=0; i<C, i++ do

  generate a new solution indnew through Probability Vector (PV);

  indi=ind.copy();

  int index=round(rand(0,C));

  while rand(0,1)<0.6 do

   indi,index=indnew,index;

   index++;

   if index==C then

    index=0;

   end if

  end while

end for

 return the best individual in {ind1,ind2,,indC}