Professional Documents
Culture Documents
1 sur 10
http://www.scholarpedia.org/article/Artificial_bee_colony_algorithm
doi:10.4249/scholarpedia.6915
Contents
1 Global Optimization Problem
2 The Artificial Bee Colony Meta-heuristic
2.1 Initialization Phase
2.2 Employed Bees Phase
2.3 Onlooker Bees Phase
2.4 Scout Bees Phase
3 Applications of ABC
3.1 An Unconstrained Optimization Problem: Neural Network Training for the XOR problem
3.2 A Constrained Optimization Problem: Welded Beam Design
4 Other Approaches Inspired from Honeybee Foraging Behaviour
5 Current Trends
6 References
7 Appendix -- Foraging Behaviour of Honey Bees
8 External Links
9 See also
26/05/2015 09:02
2 sur 10
http://www.scholarpedia.org/article/Artificial_bee_colony_algorithm
). The variable
and
In ABC, the colony of artificial bees contains three groups of bees: employed bees associated with specific
food sources, onlooker bees watching the dance of employed bees within the hive to choose a food source, and
scout bees searching for food sources randomly. Both onlookers and scouts are also called unemployed bees.
Initially, all food source positions are discovered by scout bees. Thereafter, the nectar of food sources are
exploited by employed bees and onlooker bees, and this continual exploitation will ultimately cause them to
become exhausted. Then, the employed bee which was exploiting the exhausted food source becomes a scout
bee in search of further food sources once again. In other words, the employed bee whose food source has
been exhausted becomes a scout bee. In ABC, the position of a food source represents a possible solution to
the problem and the nectar amount of a food source corresponds to the quality (fitness) of the associated
solution. The number of employed bees is equal to the number of food sources (solutions) since each
employed bee is associated with one and only one food source.
The general scheme of the ABC algorithm is as follows:
Initialization Phase
REPEAT
Employed Bees Phase
Onlooker Bees Phase
Scout Bees Phase
Memorize the best solution achieved so far
UNTIL(Cycle=Maximum Cycle Number or a Maximum CPU time)
26/05/2015 09:02
3 sur 10
http://www.scholarpedia.org/article/Artificial_bee_colony_algorithm
Initialization Phase
All the vectors of the population of food sources,
s, are initialized
population size) by
scout bees and control parameters are set. Since each food source,
variables, (
where
and
respectively.
) in their memory. They find a neighbour food source and then evaluate its profitability (fitness).
where
where
is a random
and
might be calculated for minimization problems using the
26/05/2015 09:02
4 sur 10
http://www.scholarpedia.org/article/Artificial_bee_colony_algorithm
is
determined by using equation (6), and its fitness value is computed. As in the employed bees phase, a greedy
selection is applied between
and
can be
defined by (5). Hence those sources which are initially poor or have been made poor by exploitation are
abandoned and negative feedback behaviour arises to balance the positive feedback.
In summary, the ABC algorithm,
1) is inspired by the foraging behaviour of honeybees,
2) is a global optimization algorithm,
3) has been initially proposed for numerical optimization (e.g.: Karaboga, 2005),
4) can be also used for combinatorial optimization problems (eg: Pan et al, 2010),
5) can be used for unconstrained and constrained optimization problems (eg: Karaboga and Akay, 2009;
Karaboga and Basturk 2007b; Domnguez 2009),
6) employs only three control parameters (population size, maximum cycle number and limit) that are to be
predetermined by the user,
7) is quite simple, flexible and robust (some of the relevant publications expressing these merits of the ABC
algorithm are Rao et al, 2008; Kang et al, 2009; Singh, 2009; Karaboga, 2009, included in the References
list).
26/05/2015 09:02
5 sur 10
where
http://www.scholarpedia.org/article/Artificial_bee_colony_algorithm
iteration;
is the desired output node;
is the actual value of the th output node;
output nodes; and is the number of patterns.
is the number of
The neural networks are being successfully applied to solving problems in pattern classification, function
approximation, optimization, pattern matching and associative memories.
Exclusive-OR (XOR) is a difficult classification problem mapping two binary inputs to a single binary output
as (0 0;0 1;1 0;1 1)> (0;1;1;0). This classical benchmark problem is a hard task also for the neural networks.
In the simulations a 2-2-1 feed-forward neural network having six
connection weights and no biases (having six parameters, XOR6), a 2-2-1
feed-forward neural network having six connection weights and three
biases (having 9 parameters, XOR9) and a 2-3-1 feed-forward neural
network having nine connection weights and four biases (having thirteen
weights, XOR13) were used.
In Table 1, mean MSE values of 30 runs of each configuration are
recorded for ABC and for the standard Particle Swarm Optimization
(PSO) (Eberhart and Kennedy, 1995); each run of the algorithms was
started with a random population with different seeds. The population
size, SN, was set to 50 and the limit value was set to SN*n, where n is
dimension of the weight set.
Figure 1: An example of
neural network structure for
the XOR problem
XOR9
XOR13
which in structural engineering are commonly symbolized by the letters shown in Fig. 2 (
). Structural
analysis of this beam leads to the following nonlinear objective function subject to five nonlinear and two
linear inequality constraints as given below:
26/05/2015 09:02
6 sur 10
http://www.scholarpedia.org/article/Artificial_bee_colony_algorithm
subject to
The optimum solution is located on the boundaries of the feasible region, and the ratio of the feasible region
to the entire search space is quite small for this problem, which makes it a truly difficult problem for any
optimization algorithm.
Generally, a constraint handling technique should be
incorporated to the optimization algorithms proposed
for solving unconstrained problems. Therefore, in order
to handle the constraints of this problem, the ABC
algorithm employs Debs rules, which are used instead of
the greedy selection employed between
and
in
the version of ABC proposed for unconstrained
optimization problems (Karaboga and Basturk, 2007).
Debs method uses a tournament selection operator,
where two solutions are compared at a time by applying
the following criteria (Deb, 2000):
Any feasible solution satisfying all constraints is
preferred to any infeasible solution violating any of
the constraints,
Among two feasible solutions, the one having better fitness value is preferred,
Among two infeasible solutions, the one having the smaller constraint violation is preferred.
Table 2 presents the values of the variables and the constraints for the optimum solution found by ABC. Table
3 shows the summary statistics obtained from 30 runs of the ABC algorithm as compared to those of the
-ES method (Montes and Coello, 2005). The low mean and standard deviation values show the
robustness of the ABC algorithm.
Table 2: Parameter and constraint values of the best solution obtained by the ABC algorithm
x1
x2
x3
x4
g1
g2
g3
g4
g5
g6
g7
f(x)
-ES) algorithms
30000
30000
26/05/2015 09:02
7 sur 10
http://www.scholarpedia.org/article/Artificial_bee_colony_algorithm
In 2001, Lucic and Teodorovic introduced a Bee System based on the foraging behaviour of bee colonies for
solving difficult combinatorial optimization problems (Lucic and Teodorovic, 2001). Teodorovic and Dell
(2005) proposed a Bee Colony Optimization (BCO) meta-heuristic for the ride-matching problem in 2005.
Another algorithm simulating foraging behaviour is the BeeAdHoc model described by Wedde and Farooq
(2005c), which is an energy efficient routing method in mobile ad hoc networks. In 2005, Drias and Yahi
(2005) described a meta-heuristic named Bees Swarm Optimization and its adaptation to the features of the
MAX-W-SAT problem was introduced to contribute to its resolution. Chong et al. (2006) proposed a bee
colony optimization algorithm based on dance durations to select a new path; the algorithm was applied to
job shop scheduling. Quijano and Passino (2007) introduced a model of honey bee social foraging for solving
a class of optimal resource allocation problems.
Approaches for Numerical Optimization
In 2005, Yang (2005) developed a virtual bee algorithm (VBA) to solve numerical optimization problems. The
original algorithm works with only two variables. Pham et al. (2005) described the Bees Algorithm which
performs a kind of neighbourhood search combined with random search and can be used for both
combinatorial optimization and numerical optimizations.
The initial applications of ABC were in the area of numerical optimization since it was originally proposed for
these kinds of problems (Karaboga, 2005).
Current research topics include the extension of ABC to the optimization of hybrid functions; to the solution
of integer programming and engineering design problems (Rao et al., 2008; Singh, 2009; Karaboga, 2009);
to the solution of combinatorial (Pan et al, 2010) and multi-objective optimization problems (Omkar et al,
2010) and to the solution of clustering (Karaboga and Ozturk, 2010), neural network training (Karaboga and
Ozturk, 2009) and image processing (Xu and Duan, 2010) problems.
Several papers reporting the research related to ABC and its applications can be found at
http://mf.erciyes.edu.tr/abc
Chong, C. S., Sivakumar, A. I., Malcolm Low, Y. H., Gay, K. L. (2006). A bee colony optimization algorithm to
job shop scheduling. In Proceedings of the 38th conference on Winter simulation WSC '06, pages 1954-1961,
California.
Deb, K. (2000). An efficient constraint handling method for genetic algorithms, Computer Methods in
Applied Mechanics and Engineering, 186(2- 4):311338, Elsevier, Netherlands.
Domnguez, O. C. (2009), An adaptation of the scout bee behavior in the Artificial Bee Colony algorithm to
solve constrained optimization problems, Laboratorio Nacional de Informtica Avanzada (LANIA), MsC,
Thesis, Supervisor: Efrn Mezura-Montes.
Drias, H. S. S., Yahi, S. (2005). Cooperative bees swarm for solving the maximum weighted satisfiability
problem. In Computational Intelligence and Bioinspired Systems, volume 3512/2005 of LNCS: 318 325,
Springer, Berlin.
Goldberg, D.E. (1989), Genetic algorithms in search, optimization and machine learning, Addison-Wesley
Professional, ISBN: 0201157675.
Kang, F., Li, J., Xu, Q. (2009), Structural inverse analysis by hybrid simplex artificial bee colony algorithms,
26/05/2015 09:02
8 sur 10
http://www.scholarpedia.org/article/Artificial_bee_colony_algorithm
26/05/2015 09:02
9 sur 10
http://www.scholarpedia.org/article/Artificial_bee_colony_algorithm
Tereshko, V., Loengarov, A. (2005), Collective decision-making in honey bee foraging dynamics, Computing
and Information Systems, 9 (3): 1-7, University of the West of Scotland, UK.
Teodorovic, D., Dell, M. O. (2005). Bee colony optimization - a cooperative learning approach to complex
transportation problems, In Proceedings of 10th EWGT Meeting and 16th Mini EURO Conference, pages: 5160.
Vries, H., Biesmeijer J.C. (1998), Modelling collective foraging by means of individual behaviour rules in
honey-bees, Behavioral Ecology and Sociobiology , 44: 109-124, Springer, Berlin.
Wedde, H., Farooq, M. (2005). The wisdom of the hive applied to mobile ad-hoc networks. In Proceedings of
the Swarm Intelligence Symposium 2005, pages: 341-348, Pasadena, California.
Xu, C., Duan, H. (2010), Artificial bee colony (ABC) optimized edge potential function (EPF) approach to
target recognition for low-altitude aircraft, Pattern Recognition Letters, Elsevier, Netherlands, In Press.
Yang, X. S. (2005). Engineering optimizations via nature-inspired virtual bee algorithms. In Artificial
Intelligence and Knowledge Engineering Applications: A Bioinspired Approach, volume 3562/2005 of LNCS:
317-323, Springer, Berlin.
Internal references
Marco Dorigo (2007) Ant colony optimization. Scholarpedia, 2(3):1461.
Howard Eichenbaum (2008) Memory. Scholarpedia, 3(3):1747.
Marco Dorigo, Marco A. Montes de Oca, Andries Engelbrecht (2008) Particle swarm optimization.
Scholarpedia, 3(11):1486.
Hermann Haken (2008) Self-organization. Scholarpedia, 3(8):1401.
Marco Dorigo and Mauro Birattari (2007) Swarm intelligence. Scholarpedia, 2(9):1462.
An interesting swarm is a honey bee colony which performs tasks within and out of the hive in an intelligent
manner. Since the availability of the nectar sources around the hive varies in space and time, the colony of
bees has to adapt its foraging behaviour to the changes in the environment. For instance, an appropriate
division of the workers efforts between exploring new sources and exploiting the available ones is very
important for the maintenance of the colony (Vries and Biesmeijer, 1998). As stated before, the minimal
model of forage selection that leads to the emergence of collective intelligence of honey bee swarms consists
of three essential components: food sources, employed foragers, and unemployed foragers (Tereshko and
Loengarov, 2005).
(i) Food sources: The profitability of a food source is related to several factors such as its closeness to the
nest, richness of energy, and the ease of extracting the energy from the source. In the minimal model, the
profitability may be defined by one of these quantities.
(ii) Employed foragers: These foragers are associated with a specific food source they exploit. They carry
information to the hive and share it with other foragers waiting in the hive by dancing.
(iii) Unemployed foragers: These foragers consist of scouts and onlookers. The scouts randomly search
the environment surrounding the hive for new food sources, and the onlooker bees waiting in the hive detect
a food source by means of the information presented to them by the employed foragers (Tereshko and
Loengarov, 2005).
26/05/2015 09:02
http://www.scholarpedia.org/article/Artificial_bee_colony_algorithm
The exchange of information among the foragers is very important for the formation of collective knowledge.
The most important part of the hive for exchanging information is the dancing area where different types of
dances are performed: Waggle dance, Round dance, Tremble dance, etc. Communication among bees related
to the quality of food sources is called the waggle dance. Since information about all the current rich sources
is available to onlooker bees on the dance floor, they watch numerous dances and direct themselves to
profitable sources. Employed foragers share their information in proportion to the profitability of their food
sources. As the information circulating about them increases, the probability of the onlooker bees choosing
the more profitable sources also increases (Tereshko and Loengarov, 2005).
http://mf.erciyes.edu.tr/abc http://mf.erciyes.edu.tr/abc]: This is the official web site dedicated to the ABC
Algorithm
10 sur 10
26/05/2015 09:02