A New Logistic Dynamic Particle Swarm Optimization Algorithm Based on Random Topology

Algorithm 2

The proposed generating method of random population topology.

(1) For the population that the size is 𝑆, build a 𝑆∗𝑆 matrix, and let 𝐿(𝑖,𝑖)=1;

(2) Select a 𝐾 value, for each row 𝑖 of the matrix 𝐿, generate a uniformly distributed random number

   m (𝑚≠𝑖) from {1,…,𝑚} (𝑚 may be selected repeatedly), let 𝐿(𝑖,𝑚)=𝐿(𝑚,𝑖)=1;

(3) Use the Dijkstra algorithm to calculate the distance between the particles and stored in the 𝑆∗𝑆 matrix 𝐷;

(4) While  The graph corresponding to the generating random topology is not connected  do

(5)   Scan the matrix 𝐷;

(6)   IF two particles 𝑢 and 𝑣 are not connected;

(7)   Let 𝐿(𝑢,𝑣)=1;