Professional Documents
Culture Documents
An Improvement of Genetic Algorithm For Optimization Problem
An Improvement of Genetic Algorithm For Optimization Problem
An Improvement of Genetic Algorithm For Optimization Problem
Optimization Problem
Abstract—This paper proposed an improvement of genetic The Following contents include: section 2 describes the
algorithm for optimization problem. In this study, the Gaussian original genetic algorithm (GA). Section 3 presents the
function is applied in crossover and mutation operators instead proposed algorithm in details. The experimental results are
of traditional crossover and mutation. The algorithm is tested on demonstrated in section 4. Finally, the conclusion is illustrated
five benchmark problems and compared with the self-adaptive and discussed in section 5.
DE algorithm, traditional differential evolution (DE) algorithm,
the JDE self-adaptive algorithm and the hybrid bat algorithm
with natural-inspired. The computation results illustrate that the II. GENETIC ALGORITHM
proposed algorithm can produce optimal solutions for all Genetic algorithm (GA) is a meta-heuristic search
functions. Comparing to the other four algorithms, the proposed algorithm based on the evolutionary. The main idea is derived
algorithm provides the best results. The finding proves that the the behavior of reproduction animal, consist of selection,
algorithm should be improved in this direction. crossover and mutation. Genetic algorithms represent an
intelligent exploitation of a random search. It has been applied
Keywords—optimization function; genetic algorithm; genetic
to solve optimization problem for many years. The original
operator; crossover operator; mutation operator
genetic algorithm is consists of the following component:
I. INTRODUCTION Step 1: generate an initialize of the populations (NP vector
solutions) randomly.
Optimization is an attempt to get the best solution of the
problem under the given circumstances. The main objective of Step 2: the fitness function/objective function of the
the optimization is to increase the desired benefits or reduce the populations are evaluated.
time. The processes of optimization methods are the act of
Step 3: the next generation is produced by the following steps:
trying to achieve optimal solution of the given objective
function. In the literature, many algorithms have been brought (a) select two current populations, P1 and P2 (roulette
to solve the problem. Nature-inspired algorithm as genetic wheel).
algorithm is a capable algorithm which has been improved and
published by many researchers. The genetic algorithm (GA), (b) apply one-point crossover operator to P1 and P2 with
proposed by Holland [1], is the most popular algorithm in this crossover rate (Pc) to obtain a child chromosome C1 and C2.
field. The two important operators of genetic algorithm affect (c) apply mutation operator to C1 and C2 with mutation rate
the performance of the algorithm directly. The first operator is (Pm) to produce C1’ and C2’.
crossover that selects two parents to combine together with a
form of the option to create a new child. The other operator is (d) select the new generations by their fitness ranking.
mutation that improves new child randomly. Step 4: replace the source population with the new generations.
Like other algorithms, the GA sometime stuck in the local Step 5: if stopping criteria is not met, return to Step 2.
minimums. In order to improve the GA performance, some
researchers improve the crossover operator e.g. Varnamkhasti
III. THE PROPOSED ALGORITHM
et al. [2], Kaya et al. [3], and Vrajitoru [4] while other propose
the new mutation operator e.g. Srinivas and Patnaik [5]. This paper aims to improve the operators of genetic
algorithm (crossover and mutation) with Gaussian function for
This paper proposed an improvement of genetic algorithm continuous optimization problem. After generates population
for optimization problem. The Gaussian function is applied in and evaluates their fitness values, the improved procedure of
crossover and mutation operators instead of traditional crossover and mutation will be applied. The processes are
operators. The aim is to improve the two operators of GA in explained in details as follows:
order to solve the optimization function efficiently.
(i) The selection step, using roulette wheel for random select
two current individuals, P1 and P2.
°
( ) ( ) ( )
G Fj ; if f G Fj < f G M
j < f Gavg
G cross
j
°
= ® GM
j ( ) ( ) ( )
; if f G Mj < f G Fj < f Gavg (1)
°
¯ ( ) ( ) ( )
°Gavg ; if f Gavg < f G Fj < f G M j
( )
ª P1 2 º
« xj » Fig. 1. The Crossover Operation (crossover rate = 0.7).
« »
« 2σ 2 »
1 « P1 »
−¬
G Fj = e ¼ (2)
2πσ P21
(iii) After the crossover step, mutation operation is working on
all children by equations:
( )
ª P2 2 º
( ) ( ) ( )
« xj »
« » xGj ; if f xGj < f x Rj 1 < f x Rj 2
« 2σ 2 » °
1 « P2 »
GM
j =
2πσ P2 2
e− ¬ ¼ (3) xM
j
°
( ) ( ) ( )
= ® x Rj 1 ; if f x Rj 1 < f xGj < f x Rj 2 (5)
°
( ) ( ) ( )
° x Rj 2 ; if f x Rj 2 < f xGj < f x Rj 1
¯
(
Gavg = x Pj 1 + x Pj 2 / 2 ) (4)
( )
ª c 2º
« xj »
« »
« 2σ 2 »
« c »
1 −¬
xGj = e ¼ (6)
where j = 1, 2, 3,! , D , D is the dimension of population vector. 2πσ c2
G cross the results of value in the crossover
j
conditions.
j = x j + rand ( −0.05,0.05 )
xR1 c (7)
G Pj1 the value of genes (P1) was calculated by
Gaussian function.
V. CONCLUSIONS
This paper proposed an improvement of genetic algorithm
for optimization function. In order to improve the performance
of genetic algorithm, the Gaussian function is applied to
calculate gene values in crossover and mutation operators. The
testing on five various functions shows that the proposed
algorithm provides the optimal value for all of them. The
experimental results confirm that the proposed algorithm can
solve the continuous functions, the discontinuous function, and
the multimodal function efficiently.
ACKNOWLEDGMENT
The authors would like to acknowledge School of
Information and Communication Technology, University of
Phayao, Thailand for all resources and financial support.
TABLE I. THE BENCHMARK FUNCTIONS
D D
f 2 ( x ) = ¦ xi + ∏ xi 2000 30 [-10, 10] 0
i =1 i =1
2
D § i ·
f3 ( x ) = ¦ ¨ ¦ x j ¸ 5000 30 [-100, 100] 0
i =1 © j =1 ¹
§ 1 D 2· § 1 D ·
f10 ( x ) = −20exp ¨ −0.2 ¦ xi ¸ − exp ¨ ¦ cos 2π xi ¸ + 20 + e 1500 30 [-32, 32] 0
¨ 30 i =1 ¹ ¸ © 30 i =1 ¹
©
f2 1.5E-9 1.0-23 0 0 0
f3 0 0 0 0 0
f4 0 0 0 0 0