Optimization of the Critical Diameter and Average Path Length of Social Networks

Algorithm 1

Framework of our algorithm.

Input: the maximum iteration number: ; population size: ; mating pool size: ;

         tournament size: ; crossover probability: ; mutation probability: ; the initial network

         adjacency matrix: .

  ← ;

Repeat

 ← ;

 ← ;

 ← ;

 ← ;

Until

Output: the number of added edges, the position of added edges.