Hierarchical Artificial Bee Colony Algorithm for RFID Network Planning Optimization

Algorithm 1

Pseudocode of the original ABC algorithm.

Original ABC algorithm
(1) Initialization.
Initialize the food sources and evaluate the nectar amount (fitness) of food sources;
Send the employed bees to the current food source;
Iteration = 0;
(2) Do while (the termination conditions are not met)
(3) /Employed Bees’ Phase/
for (each employed bee)
find a new food source in its neighborhood following (8);
Evaluate the fitness of the new food source, Apply greedy selection;
end for
(4) Calculate the probability for each food source;
(5) /Onlooker Bees’ Phase/
for (each onlooker bee)
Send onlooker bees to food sources depending on ;
find a new food source in its neighborhood following (8);
Evaluate the fitness of the new food source, Apply greedy selection;
end for
(6) /Scout Bees’ Phase/
if (any employed bee becomes scout bee)
Send the scout bee to a randomly produced food source;
end if
(7) Memorize the best solution achieved so far
Iteration = Iteration + 1;
end while
(8) Output the best solution achieved