Interactive Artificial Bee Colony (IABC)

Optimization
Pei-Wei Tsai, Jeng-Shyang Pan,
Bin-Yih Liao, and Shu-Chuan Chu

pwtsai@bit.kuas.edu.tw
2
Outline
Introduction
Artificial Bee Colony (ABC) Algorithm
Interactive Artificial Bee Colony (IABC)
Experiments and Experimental Results
Conclusions
3
Introduction
Swarm Intelligence employs the collective
behaviors in the animal societies to design
algorithms.

In 2005, Karaboga proposed an Artificial Bee
Colony (ABC), which is based on a particular
intelligent behavior of honeybee swarms.

4
Artificial Bee Colony (ABC)
ABC is developed based on inspecting the
behaviors of real bees on finding nectar and
sharing the information of food sources to the
bees in the hive.

Agents in ABC:
The Employed Bee
The Onlooker Bee
The Scout
5
Artificial Bee Colony (ABC) (2)
The Employed Bee:
It stays on a food source and provides the
neighborhood of the source in its memory.
The Onlooker Bee:
It gets the information of food sources from
the employed bees in the hive and select one
of the food source to gathers the nectar.
The Scout:
It is responsible for finding new food, the new
nectar, sources.
6
Artificial Bee Colony (ABC) (3)
Procedures of ABC:
Initialize (Move the scouts).
Move the onlookers.
Move the scouts only if the counters of the
employed bees hit the limit.
Update the memory
Check the terminational condition
7
Movement of the Onlookers
Probability of Selecting a nectar source:

(1)

P
i
: The probability of selecting the i
th
employed
bee
S : The number of employed bees

i
: The position of the i
th
employed bee
: The fitness value
( )
( )

=
=
S
k
k
i
i
F
F
P
1
u
u
( )
i
F u
8
Movement of the Onlookers (2)
Calculation of the new position:
(2)
: The position of the onlooker bee.
t : The iteration number
: The randomly chosen employed bee.
j : The dimension of the solution
: A series of random variable in the
range .

( ) ( ) ( ) ( ) ( ) t t t t x
kj ij ij ij
u u | u + = +1
i
x
k
u
( ) - |
| | 1 1, -
9
Movement of the Scouts
The movement of the scout bees follows
equation (3).
(3)

r : A random number and
( )
min max min j j j ij
r u u u u + =
| | 1 , 0 e r
10
Artificial Bee Colony (ABC) (4)
The Employed Bee
The Onlooker Bee
The Scout
( )
( )

=
=
S
k
k
i
i
F
F
P
1
u
u
Record the best
solution found so far
( ) ( ) ( ) ( ) ( ) t t t t x
kj ij ij ij
u u | u + = +1
( )
min max min j j j ij
r u u u u + =
11
Discussion
The movement of the onlookers is limited to
the selected nectar source and the randomly
selected source.

Suppose we find a way to consider more
relations between the employed bees and the
onlookers, we may extend the exploitation
capacity of the ABC algorithm.
12
Universal Gravitation
Universal Gravitation is an invisible force
between objects.
(4)

: The gravitational force heads from object 1
to 2.
G : The universal gravitational constant.
m : The mass of the object.
: The separation between the objects.
: The unit vector in the form of equation.
^
21
2
21
2 1
12
r
r
m m
G F =
12
F
21
r
^
21
r
13
Interactive Artificial Bee Colony
In Interactive Artificial Bee Colony (IABC), the
mass in equation (4) is replaced by .
Euclidean distance is applied for
calculating .
The normalization procedure is applied to the
fitness values we used in equation (4) and
the normalized fitness values are given as .

( )
i
F u
21
r
~
ik
F
14
Interactive Artificial Bee Colony (2)
After employing the universal gravitation into
equation (2), it can be reformed as follows:
(5)

By applying equation (5) and simultaneously
considering the gravitation between the
picked employed bee and n selected
employed bees, it can be reformed again into
equation (6).
(6)
( ) ( ) ( ) ( )] [ 1 t t F t t x
kj ij ik ij ij
j
u u u + = +
( ) ( ) ( ) ( )

=
+ = +
n
k
kj ij ik ij ij
t t F t t x
j
1
~
] [ 1 u u u
15
Interactive Artificial Bee Colony (3)
1
2
i
1 i
F
2 i
F
2 = n
( ) ( ) ( ) ( )

=
+ = +
n
k
kj ij ik ij ij
t t F t t x
j
1
~
] [ 1 u u u
16
Experiments


To analyze the performances, the
experiments are made with three well-known
benchmark functions, and the results are
compared with ABC and Particle Swarm
Optimization (PSO).
17
Experiments (2)

18
Experiments (3)

Conditions:

Dimension of the solution: 50
Runs for average: 30
Iteration number: 5000
Population size: 100
19
Experiments (4)
To apply IABC for solving problems related to
optimization, the number of the considered
employed bee n should be predetermined.

In these experiments, the number of n is set
to 4.
20
Experimental Results
( ) ( ) 1
100
cos 100
4000
1
1 1
2
1
+
|
|
.
|

\
|
|
|
.
|

\
|
|
.
|

\
|
=
[
= =
n
i
i
n
i
i
i
x
x x f
21
Experimental Results (3)

( ) ( ) ( )

=
+ =
n
i
i i
x x x f
1
2
2
10 2 cos 10 t
22
Experimental Results (2)

( ) ( ) ( )

=
+
+ =
1
1
2
2
2
1 3
1 100
n
i
i i i
x x x x f
23
Conclusions
IABC is proposed in this paper.
It leads in the concept of universal gravitation
to the movement of onlooker bees in ABC,
and it successfully increases the exploitation
ability of ABC.
The performance of IABC, ABC and PSO are
compared in the experiments, and the value
of n with the best reaction is also discussed
and analyzed.
24
Thank You for Your Attention.
Any Question?