Improved Sparrow Search Algorithm Based on Iterative Local Search

Algorithm 1

The framework of the ISSA.

	Input:
	M: maximum number of iterations
	PD: proportion of discoverer
	SD: proportion of scouters
	R2: alert value
	N: population sparrows
	Output: Xbest,
	Initialize population
	t = 1;
	While (t < M)
	Find the position of the best and worst sparrow individuals according to fitness values.
	R2 = rand (1)
	For i = 1 : PD
	Update the location of the discoverers according to formula (1);
	End for
	For i = (PD + 1) : N
	Update the location of the followers according to formulas (5)–(7) and (12);
	End for
	For l = 1 : SD
	Get the individual position of a sparrow that is aware of danger according to formulas (3), (16), and (19);
	End for
	Get the location of the new optimal individual;
	Update the all individuals’ location according to formula (27);
	t = t + 1
	End while
	Return: Xbest,