Skip to main content
. 2021 Nov 11;21(22):7499. doi: 10.3390/s21227499
Algorithm 3 VelocityUpdate_V2.
  • 1:

    for individual pi,i=1 to n do

  • 2:

       Get the index jb of the biggest in ϕi={ϕi,j}j=1k.

  • 3:

       tempd=0,normaf=0.

  • 4:

       for task Tj,j=1 to k do

  • 5:

         if j=jb or rand<ϕi,j then

  • 6:

            r2=rand

  • 7:

            tempd=tempd+r2*ϕi,j*(gbestj,dxi,dg).

  • 8:

            normaf=normaf+ϕi,j.

  • 9:

         end if

  • 10:

         vi,dg+1=wvi,dg+c1r1(pbesti,dxi,dg)+c2(tempd/normaf).

  • 11:

       end for

  • 12:

    end for