Constraint Consensus Based Artificial Bee Colony Algorithm for Constrained Optimization Problems

Table 3

Constraint consensus algorithm.

Inputs:	a set of constraints
	an initial point x
	a feasibility distance tolerance
	a movement tolerance
1	NINF = 0, for all
2	for every constraint
	2.1 if is violated
	2.1.1 Find the feasibility vector and the feasibility distance
	2.1.2 if the feasibility distance is greater than
	NINF = NINF+1
	for every variable in
	end for
	end if
	end if
	end for
3	if NINF = 0, then exist successfully
4	for every variable
	end for
5	if then exit unsuccessfully
6
7	if necessary, reset to respect any violated variable bounds
8	Go to step1