Input:  𝑃 S T 𝑜 : The information parameters of nodes
      𝑆 𝑖 : The 𝑖 th particle swarm
      𝑏 ( 𝐿 , 𝑖 ) : Each sub-swarm’s optimal position vector function
      𝑃 G e n : The iterated generations for searching process
Output:  𝑣 𝑡 + 1 𝑖 𝑑 and 𝑥 𝑡 + 1 𝑖 𝑑 : The velocity and position of each sub-swarm and its particle
     t n e s s ( 𝑝 𝑖 ) : The global optimal fitness
Process:
    For each swarm 𝑖 [ 1 𝑘 ]
     For each particle 𝑚 [ 1 𝑛 / 𝑘 ]
      Update velocity and position of each sub swarm’s particle
     If t n e s s ( 𝑏 ( 𝑥 𝑚 𝑆 𝑖 , 𝑖 ) ) t n e s s ( 𝑏 ( 𝑝 𝑚 𝑆 𝑖 , 𝑖 ) ) , 𝑏 ( 𝑝 𝑚 𝑆 𝑖 , 𝑖 ) = 𝑏 ( 𝑥 𝑚 𝑆 𝑖 , 𝑖 )
     Else If t n e s s ( 𝑏 ( 𝑥 𝑚 𝑆 𝑖 , 𝑖 ) ) < t n e s s ( 𝑏 ( 𝑝 𝑚 𝑆 𝑖 , 𝑖 ) ) , 𝑏 ( 𝑝 𝑚 𝑆 𝑖 , 𝑖 ) = 𝑏 ( 𝑝 𝑚 𝑆 𝑖 , 𝑖 )
     Calculate t n e s s ( 𝑝 𝑖 ) of the particle (path)
     End For
     𝑏 ( 𝑝 𝑔 𝑆 𝑖 , 𝑖 ) = a r g 𝑃 ( 𝑝 𝑚 𝑆 𝑖 , 𝑖 ) m a x 𝑓 𝑖 𝑡 𝑛 𝑒 𝑠 𝑠 ( 𝑏 ( 𝑝 𝑚 𝑆 𝑖 , 𝑖 ) )
    End For
Algorithm 4: Update mechanism in the ICPSOA.