(1) Begin
(2) Initialize particles’ position, velocity, ,  gbest and the related parameters
(3) Initialize default social circle of which the particle  is a member
(4)
(5) Initialize
(6) while (fitcount < Max_FES) && ( )
(7)  For each particle
(8)     Locate the best particle position of the SCs that particle is a member of
(9)     Computer in terms of .
(10)    For each dimension
(11)      Updating the particles’ velocity and position in terms of
(12)      If fitness ( ) < fitness ( )
(13)           =
(14)      
(15)      If ceil( + )==1
(16)       If rand
(17)         
(18)       
(19)      
(20)    Next dimension
(21) Next particle
(22) Update the member of SC in terms of Figure 2(b)
(23) If (mod(k, n)) && ( )
(24)     Update particle’s DSC level.
(25) 
(26) Update each particle neighbor.
(27) Index = find ( )//find-a function which finds a particle’s position
(28) If fitness (gbest) > min( )
(29)     = , 
(30) 
(31) 
(32) End
Algorithm 3