A New Discrete Grid-Based Bacterial Foraging Optimizer to Solve Complex Influence Maximization of Social Networks

Algorithm 3 Novel reproduction process.

(1)	Each dimension of decision space is divided into M hyperboxes.
(2)	While size (P)> pop/2
(3)	If only one hyperbox has the highest crowding degree:
	Compute the fitness of each individual in this hyperbox.
	Remove the individual with the largest value of fitness.
(4)	If more than one hyperbox have the same crowding degree:
	Pick one at random from the same hyperbox.
	Compute the fitness of each individual in this hyperbox.
	Remove the individual with the largest value of fitness.
(5)	End While
(6)	Replicate these pop/2 individuals in the population end up
	with the size of population equal to pop.