COMPUSOFT, An international journal of advanced computer technology, 3 (5), May-2014 (Volume-III, Issue-V)

ISSN:2320-0790

Mathematical Study OF Adaptive Genetic Algorithm

(AGA) with Mutation and Crossover probabilities
Di panjan kumar Dey
Assistant professor, Depart ment of Co mputer Science & Engineering, PITM , Kolkata
Abstract: GAs is powerful search techniques that are used successfully to solve problems in many different
disciplines.A GA are particularly easy to imp lement and pro mise substantial gains in performance. A GA has some
parameters, such as population size, the crossover probability (Pc), the mutation probability (Pm) are varied wh ile
genetic algorithm is running. Genetic algorith m includes these parameters that should be adjusting so that the
algorith m can provide positive results. The main aim of this paper is that how to design of adaptive crossover
probability (Pc) and mutation probability (Pm).By varying Pc and Pm adaptively it response to the fitness values of the
solution.
Depending the fitness value of the solution, in AGA the crossover probability (Pc ) and the mutation probability(P m)
are varied. High- fitness solutions are protected, while solutions with sub average fatnesses are totally disrupted,
that is by varying the crossover probability (Pc ) and the mutation probability(Pm) adaptively in response to the
fitness value of the solution: when the population tends to get struck at a local optimu m, the crossover probability
(Pc ) and the mutation probability(P m) are increased and when the population is scattered in the solution space , the
crossover probability (Pc ) and the mutation probability(P m) are decreased.
Keywords: crossover probability (Pc ), mutation probability(P m)
optimu m, local or g lobal after locating the region
INTRODUCTION
containing the optimu m. The second characteristic is
Crossover and mutation operators of genetic
that the capacity to explore the new regions of the
algorith ms are used for constructing the adaptive
solution space in search of the global optimu m. The
abilities. The choice of (Pc ) and (Pm) is known to
balance between these two characteristics of the GA
critically affect the behavior and performance of
is directed by the values of Pm and Pc and the type of
GAs. The crossover rate controls the capability of
the operators employed.
GAs in exp lo iting a located hill to reach the local
It is common ly understood that crossover plays a
optima. The higher the crossover rate, the quicker
important role in conversing, by comb ining the
exploitation proceeds. The crossover probability (Pc )
solutions closed to an optimu m. If we choose
controls the rate at which solutions are subjected to
solutions with higher fitness values for crossover, we
crossover. The higher the value of (Pc ) the quicker
may expect GA to converge faster to the nearby
are the new solutions introduced into the population.
optimu m. On the other hand when population
A (Pc ) that is too large would disrupt individuals
becomes too homogeneous it is not clever to favour
faster than they could be exploited. The mutation rate
solutions to that way, because there is a danger of
controls the speed of GAs in exploring a new area.
getting stuck to a local optimu m.
Small (Pm) values are commonly adopted in GAs.
Mutation is the operator which is mainly responsible
Typical values of (Pc )are in the range 0.5~1.0, wh ile
for preventing GA of becoming stuck. If a population
typical values of (Pm) are in the range 0.001~0.05 are
converges to a local optimu m, it is possible to drive it
commonly emp loyed in GA practice.
way with increased mutation probabilities. But to
vary the choice of solutions to be crossed and the
Adapti ve probabilities of crossover and mutati on
mutation rate, it is essential to be able to identify
operators
whether the GA is conversing to an optimu m.
Two characteristics are held are essential in GAs for
optimizing
mu ltimodal functions. The first
Design of adapti ve crossover probability (P c) and
characteristic is the capacity to converge to an
the mutati on probability (Pm ):

765

COMPUSOFT, An international journal of advanced computer technology, 3 (5), May-2014 (Volume-III, Issue-V)

Let be the average fitness value of the population,

fmax be the maximu m fitness value of the population,
The value fma x - is yardstick for detecting the
convergence of genetic algorith m.

Thus we see from equation (1) & (2) and fro m figure

The value f max - is likely to be less for a population

that has converged to an optimu m solution than for a
population scattered in the solution space.

2) Pc & P m depends for all the solution of the

population.

1) Pc & P m do not depend on the fitness value of any

particular solution of the population.

3) At the same levels of mutation and crossover are

subjected to solution with high fitness values as well
as solution with low fitness values.

Fro m figure we notice that fmax- decreases when the

GA converges to a local optimu m with a fitness value
of 0.5.Note that the globally optimal solution has a
fitness value of 1.0.

4) Pc & P m increase and may cause the disruption of

the near optimal solutions. When a particular solution
of the population converges to a globally optimal
solution (or even locally optimal solution),the
population may never converge to the global
optimu m.

The values of Pc and Pm are varied depending on fmax

Since Pc and P m have to be increased when the GA
converges to a local optimu m, i.e. When f max decreases, Pc and Pm varied inversely with f max- .
Thus Pc is inversely proportional to fma x- and (Pm) is
inversely proportional to fma x- , i.e. When
Pc increased fmax - decreased and vice versa.
Similarly P m increased fmax- decreased and vice
versa.

Though we may prevent the GA fro m getting stuck at

a local optimu m, the performance of GA (in terms of
the generations required for convergence) will
certainly deteriorate.
To overcome the above-stated problem, we need to
preserve good solutions of the population. This can
be achieved by having lower values of Pc & Pm for
high fitness solutions and higher values of Pc & P m
for low fitness solutions. While the high fitness
solutions aid in the convergence of the GA, the low
fitness solutions prevent the GA fro m getting stuck at
a local optimu m. The value of P m should depend not
only on fmax - , but also on the fitness value f o f the
solution. Similarly, Pc should depend on the fitness
values of both the parent solutions. The closer f is to
fmax, the smaller P m should be, i.e., P m should vary
directly as fmax f . Similarly, Pc should vary
directly as fmax - f, where f is the larger of the
fitness values of the solutions to be crossed.

Thus we can write,

Pc

1
fmax

Or, Pc =

and P m

K1
fmax

1
fmax

(1)and Pm=

2
fmax

..(2),

Where K1 and K2 are constants of proportionality

The expressions for Pc now take the form

Pc (fmax - f)
But we know, Pc

1
fmax

Co mbine these two we get,

fmax
Pc [

Or, Pc = 1 [

fmax

Fig-

],

], 1 1.0 ------------- (3)

Where K1 is the constant of proportionality

And the expressions for P m now take the form

766

COMPUSOFT, An international journal of advanced computer technology, 3 (5), May-2014 (Volume-III, Issue-V)

P m ( fmax f)
But we know, P m

useful and relevant when the values of P c and Pm do

not vary.

1
fmax

One of the goals of our approach is to prevent the GA

fro m getting stuck at a local optimu m. To achieve
this goal, we employ solutions with sub average
finesses to search the search space for the region
containing the global optimu m. Such solutions need
to be completely disrupted, and for this purpose we
use a value of 0.5 for k 4 . Since solutions with a
fitness value of 7 should also be disrupted
completely, we assign a value of 0.5 to k 2 as well.

Co mbine these two we get,

Pm [

Or, P m = 2 [

],

], 2 1.0 -------------- (4)

Where K2 is the constant of proportionality

It is to be noted that Pc and Pm are zero for the
solution with maximu m fitness.

Based on similar reasoning, we assign 1 and 3 a

value of 1 .O. Th is ensures that all solutions with a
fitness value less than or equal to compulsorily
undergo crossover. The probability of crossover
decreases as the fitness value (maximu m of the
fitness values of the parent solutions) tends to fmax
and is 0.0 for solutions with a fitness value equal to
fmax.

Fro m equation (3) and (4) we have,

Fro m equation (3), for a solution with f= then Pc
= 1
Fro m equation (4), for a solution with f= then Pm
=2

CONCLUS ION
The probabilit ies of crossover (p c) and mutation (p m)
greatly determine the degree of solution accuracy and
the convergence speed that genetic algorithms can
obtain. Instead of using fixed values of p c and p m,
AGAs utilize the population information in each
generation and adaptively adjust the pc and p m in
order to maintain the population diversity as well as
to sustain the convergence capacity. In AGA
(adaptive genetic algorithm), the adjustment of pc and
p m depends on the fitness values of the solutions. It
has been well established in GA literature that
moderately large values of Pc (0.5< Pc < 1.0) and
small value of Pm (0.001< P m < 0.05) are essential
for the successful working of Gas.

If f < f,that is solution with sub average fitness

values, Pc and Pm might assume values larger than
1.0.Now to prevent the overshooting of Pc and Pm
beyond 1.0,we have the following constraints
Pc = 3 , f
And Pm = 4 , f , where 3 , 4 1.0
To overcome the problem that Pc and Pm are zero for
the solution with maximu m fitness we introduce a
default mutation rate (of0.005) for every solution in
AGA.
For more convenience the expressions for Pc and P m
are given as
Pc = 1 [

fmax

REFERENCES
1. H. Aytug and G. J. Koehler, Stopping criteria for
fin ite length genetic algorithms, INFORMS Journal
on Co mputing, Vol. 8, 1996, pp. 183-191.
2. T. Bck, Self-adaptation in genetic algorithms,
in Proceedings of the First European Conference on
Artificial Life, 1992, pp. 263-271.
3. T. Bck, Optimal mutation rates in genetic
search, in Proceedings of the Fifth International
Conference on Genetic A lgorith ms, 1993, pp. 2-8.
4. K. Deb and S. Argrawal, Understanding
interactions among genetic algorith m parameters,in
Foundations of Genetic Algorith ms 5, 1998, pp. 265286.
5. K. A. D. Jong, An analysis of the behavior of a
class of genetic adaptive systems, PhD thesis,
University of M ichigan, 1975.

], f

Pc = 3 , f<

Pm = 2 [

], f

Pm = 4 , f<
Where 1 , 2 , 3 , 4 1.0
The moderately large values of Pc promote the
extensive recombination of schemata, while small
values of Pm are necessary to prevent the disruption
of the solutions. These guidelines, however, are

767

COMPUSOFT, An international journal of advanced computer technology, 3 (5), May-2014 (Volume-III, Issue-V)

6. K. A. D. Jong, Adaptive system design: A genetic

approach,IEEE Transactions on System, Man and
Cybernetics, Vol. 10, 1980, pp. 566-574.
7. A. E. Eiben, R. Hinterding, and Z. Michalewicz,
Parameter control in evolutionary algorith ms,IEEE
Transactions on Evolutionary Computation, Vo l. 3,
1999, pp.124-141.
8. T. C. Fogarty, Varying the probability of
mutation in genetic algorith ms, in Proceedings of
the Third International Conference on Genetic
Algorith ms, 1989, pp.104-109.
9. D. E. Goldberg,Genetic Algorith ms in Search,
Optimization & Machine Learn ing,Addison Wesley,
1989.

Di panjan Kumar Dey, graduated fro m Calcutta

University. M.sc (Mathematics) and M.Tech
(Co mputer Science &Engineering) fro m M.C.K.V
Institute of Engineering (under West Bengal
University & Technology, India). He is currently
Assistant Professor of Mathematics & Co mputer
Science in Prajnanananda Institute of Technology &
Management, West Bengal India. He is also Faculty
member of Institute of Chartered financial Analysis
of India (ICFAI) and Academic Counselor, Assistant
Coordinator of Indira Gandhi National Open
University (IGNOU) study center 2804, Kolkata. He
is a Science Journalist having Post Graduate
certificate course on journalism and media practice
fro m National Council for the Science and
Technology Communication, GOVT. OF INDIA,
New Delhi.
His research interests in Genetic Algorithms, Soft
Co mputing, Fu zzy Set, Art ificial intelligence.

768