Fast Nondominated Sorting Genetic Algorithm II with Lévy Distribution for Network Topology Optimization

Algorithm 1

The pseudocode of NSGA-II.

	Input: population size, crossover probability, mutation probability, and maximum evaluation time
	Output: the best solution set
(1)	Begin
(2)	For each individual, initialize the positions
(3)	Evaluate the positions
(4)	Perform selection operator (using nondominated sorting and crowding distance)
(5)	Perform crossover operator
(6)	Perform mutation operator
(7)	Combine parent and offspring populations
(8)	While (stop criterion is met)
(9)	Evaluate the positions
(10)	Update the population (using nondominated sorting and crowding distance)
(11)	Perform selection operator (using nondominated sorting and crowding distance)
(12)	Perform crossover operator
(13)	Perform mutation operator
(14)	Combine parent and offspring population
(15)	End
(16)	Output the optimal solutions of the population
(17)	End