(redirected from scout bee)
Also found in: Dictionary, Thesaurus, Encyclopedia.
References in periodicals archive ?
The abandoned sources are determined, and they are replaced with new sources by artificial scout bee.
Modification 2: Second modification dealt with the determination of appropriate position for a scout bee whose budget of waggle dance was exhausted.
Algorithm 3: The flow of BCO for detecting attribute outliers 1) Set BCO parameters; 2) Locate each scout bee at a random position; 3) Evaluate the fitness for each scout bee's position; 4) Select elite bees and update the solution table S; 5) Recruit a number of bees around the elite bees for neighbourhood search and evaluate their fitness; 6) Select the fittest bee from each elite region; 7) Assign the remaining bees to search randomly and evaluate their fitness; 8) Go to step 4) and repeat until the convergence and termination conditions are met.
Last phase is scout bee phase, this phase search fresh solutions in place of discarded solutions.
Among them, employed bees are responsible for exploiting the nectar sources explored before, sharing their information with onlookers within the hive, onlooker bees wait in the hive and decide on a food source to exploit based on the information shared by the employed bee colony, and scout bees choose one of the most inactive solutions and then replace it by a new randomly generated solution.
They labeled scout bees visiting the two boxes with paint marks of two colors.
When a scout bee finds nectar, she will dance for the forager bees.
When the fitness of each quantum employed bees and quantum onlooker bees does not change in limit times, then it becomes a quantum scout bee, which drops the experiences it has owned and has the ability to find new food resources, thus the quantum position is selected randomly from the R dimensions space, while the bit position is generated according to the quantum position.
The unemployed bees can be either a scout bee, which hunts for food randomly, or an onlooker bee, which searches for the food source by using the information derived from the employed bee [13, 14].
By dancing around in public, the scout bee can tell other bees where to find the best nectar.
In the iteration, the algorithm sends first each employed bee, then each onlooker bee, and finally each scout bee to explore food sources.