(Castro and Timmis, 2002). These libraries contain
gene fragments combined for creation different
immune cells. There are artificial gene libraries in
AIS. These gene libraries are used for generating
potential solutions changed by the mutation process
towards the approximation to the optimal solution.
The second one is the group of selected
algorithms – the algorithm of positive selection,
algorithm of negative selection, algorithm of clonal
selection and their modifications (Dasgupta and
Nino, 2008), (Castro, 2006), (Castro and Timmis,
2002). The algorithms of positive and negative
selection are mainly applied to classification and
recognition problems. The computer security or fault
detection is a typical application. The algorithm of
clonal selection is used especially for classification
and optimization problems (Castro and Zuben,
2000).
The third group is inspired by the immune
network theory by N. K. Jerne (Jerne, 1974). This
theory apprehends the BIS as a network of
interconnected stimulated B-cells interacting with
each other. Continuous artificial immune networks
are used mainly for modeling and simulation of the
BIS with the aid of differential or difference
equations. Discrete artificial immune networks are
based on differential equations or iterative
procedures. They are used mainly for the pattern
recognition, data analysis, machine learning or
optimization problems.
The dendritic cell algorithm is part of the last
group. It has already been used for anomalies
detection in a computer network as a classifier for
scanning computer ports (Greensmith, et al., 2005).
5 ClonAlg FOR COALITION
FORMATION
ClonAlg is the clonal selection-based algorithm
inspired by the clonal selection principle explaining
the process of antibody generation. If a B-ly
recognizes the antigen, clones of the same
specificity are created. Mutation occurs during the
cloning. It can improve the affinity (tightness of
bond) between the antigen and the B-ly in the future
reunion. The ClonAlg was originally designed for
the pattern recognition. The optimized version of
ClonAlg (ClonAlg-opt) is used for optimization
tasks (de Castro and von Zuben, 2002). The
ClonAlg-opt uses population of antibodies. This
population pictures potential solutions of the
problem (set P). The pseudo-code of the algorithm
follows this procedure (de Castro, 2006):
1. Initialization: create an initial population of
antibodies (P).
2. Fitness evaluation: determine the fitness of
each element of P.
3. Clonal selection and expansion: select n
1
highest fitness elements of P and generate
clones of these antibodies proportionally to
their fitness: the higher the fitness, the higher
the number of copies, and vice-versa.
4. Affinity maturation: mutate all these copies
with a rate that is inversely proportional to
their fitness: the higher the fitness, the
smaller the mutation rate, and vice-versa.
Add these mutated individuals to the
population P.
5. Meta-dynamics: replace a number n
2
of low
fitness individuals by (randomly generated)
new ones.
6. Cycles: repeat step 2 to 5 until a certain
stopping criterion is met.
The usage of the ClonAlg-opt for generating the
optimal coalition structure is designed for the
problem of elimination of oil spills. This problem
requires the efficient, fast and optimal cooperation
of sources because oil spills are spread in dynamic
environment.
Three agents eliminate oil spills of two different
oils in this demonstrative example. Every agent has
the list of two properties relevant for elimination of
oil spills. The first one describes how the agent
eliminates the portion of the first type of oil spill, i.
e. the usefulness of agent’s sensor in the detection of
the first type of oil spill. The second one describes
how the agent eliminates the portion of the second
type of oil spill. The coalition structure consists of
different coalitions and is represented by the
antibody molecule. The coalition consists of one or
more agents identified by an identification value.
Permutation encoding is used for the coalition
representation in the coalition structure. Two
restrictions have to be respected: Every oil spill has
to be refined by one agent minimally and coalitions
have not overlap themselves. The pseudo-code of
the algorithm follows:
1. Initialization: create an initial population of N
coalition structures (set P), eliminate
overlapping and empty coalitions.
2. Fitness evaluation: determine the quality
(fitness) of N coalition structures.
3. Clonal selection and expansion: select n
1
highest fitness coalition structures (e. g.
MULTI-AGENT COALITION FORMATION BASED ON CLONAL SELECTION
233