Skip to main content
. 2023 Jun 10;13(12):2023. doi: 10.3390/diagnostics13122023
Algorithm 1. The proposed algorithm pseudo code.
Initialize particle population
for t=1:maximum generation
  Initialize global and local best particles pb and pg
  for i=1:population size
   vit+1 = wt ∗ vit+c1 ∗ r1 ∗ pb−xit+c2 ∗ r2 ∗ pg−xit
     if vit+1 > vmax then vit+1=vmax
     else ifvit+1 < vmin then vit+1=vmin
     end
     xit+1=xit+vit+1;
     if xit+1 > xmax then xit+1=xmax
     else if xit+1 < xmin then xit+1=xmin
     end
   end
Initialize the mental search for each particle
for i = 1:population size
  S=d ∗ 0.01 ∗ u ∗ sigma(v1Beta) ∗ xi
  xs=S
   if fxit<fpbt then pbt=xit
   else if fxst<fpbt then pbt=xst
   end
 end
 fpgt<minifpbt
 wt=tmax−ttmaxwmax−wmin+wmin
end