Using Competitive Binary Particle Swarm Optimization Algorithm for Matching Sensor Ontologies

Algorithm 2

Competitive binary particle swarm optimization algorithm.

(1)	Initialization
(2)	Initialize two subpopulations and ;
(3)	Initialize and ’s global optimas, and ;
(4)	Initialize each particle’s local optima ;
(5)	generation ;
(6)	while
(7)	update each particle according to equations (3)–(8);
(8)	update each particle’s local optima ;
(9)	update and ;
(10)	Competition
(11)	[winner, loser] = compete(, );
(12)	if(winner = =  )
(13)	switch (, );
(14)	end if
(15)	update ’s guiding matrix ;
(16)	update ’s guiding matrix ;
(17)	Trade off Exploitation and Exploration
(18)	use to randomly reinitialize 10% particles in ;
(19)	use to randomly reinitialize 50% particles in ;
(20)	;
(21)	end while
(22)	return