A Species Conservation-Based Particle Swarm Optimization with Local Search for Dynamic Optimization Problems

Algorithm 3

The algorithm of spatially neighbourhoods best searching.

(1)	Input: particle of population with size
(2)	Output: particle in the neighbourhoods of
(3)	fortodo
(4)	Calculate Euclidean distance ;
(5)	end for
(6)	Sort ’s neighbours set in ascending order according to the ;
(7)	;
(8)	Select the formerly ranked particles in ;
(9)	;
(10)	Search the local best in .