Академический Документы
Профессиональный Документы
Культура Документы
III. MEIOSIS GENETIC ALGORITHM Case 1. We conduct a crossover step only on lagging
strand using MGA; therefore, chromosome on leading
In this paper, we propose an MGA in order to generate strand will not change during crossover (see Figure 3).
chromosome diversity covering search space and inherit Case 2. We conduct a crossover step on leading strand
characteristics from its parent. MGA is a method to in MGA. As a result, the chromosome on leading strand
modify GA strategy by inserting a duplication step and will be changed during crossover step and become
assume that mutation step will start performing a diversify so it can cover most of our search (see Figure
crossover step later (see Figure 2). 4).
Case 3. We conduct a crossover step on lagging strand
in MGA and compare the results with a crossover on
leading strand in MGA.
A. Performance Measurement
In order to analyze MGA performance, we use
maximum and average fitness, work speed, and evolution
speed as our indices. Work speed is the maximum of
Figure 2. Meiosis Genetic Algorithm.
MGA to GA ratio. Subsequently, evolution speed is the
maximum of child chromosome to parent chromosome
In MGA, we design an algorithm to produce child
ratio. Equations of work and speed are shown as follows:
chromosomes that inherit characteristics from their
parent. This step we called “a selection step”. We have
chosen our fitness function to make sure that this
operation will bring about only feasible strings. In
addition, we performed a chromosome duplication
process following the disparity theory of evolution [4].
Since parent chromosome will normally generate two
child chromosomes, leading strand and lagging strand, where Max is a maximum value of chromosome in
having these two types of child chromosomes will help us generation i. Work is a work speed for the first algorithm
find an optimal solution for problem(s) faster. compared with the second algorithm. The speed
286
measurement will present how GA and MGA evaluate
itself in order to provide an optimal solution.
B. Knapsack Problem
The name “Knapsack” arises from the rather unnatural
application of a hiker trying to fill her knapsack to
maximum total value. Each item she considers taking
with her has a certain value and a certain weight. An
overall weight limitation gives the single constraint.
Therefore, the standard knapsack problem considers a
number of items (n), each with a known value (v) and
weight (w), where v and w are independent. The goal is to
maximize the value obtained by selecting a subset of the
items whose collective weight does not exceed a given
capacity limit [7]. In certain contexts, the effective weight
of an item may itself be a decision variable.
Figure 5. A Comparison of Maximum and Average Fitness Value
However, problem occurs when we do not know how
between GA and MGA utilizing a Crossover on Lagging Strand.
many items we should select to knapsack in order to get
item’s maximum value and item’s weight summation. If Case 2. Similar to Case 1, we found that the maximum
the item weight summation is more than knapsack item and average fitness value of GA and MGA utilizing a
weight value, the item we choose will be set a weight crossover on leading strand are greater than GA (See
equal to zero due to the fact that we can not overload our Figure 6). In this case, the leading chromosome was
items. Therefore, the equation of knapsack problem is as evaluated by crossover, while the lagging chromosome
follows: was evaluated by mutation. Therefore, in MGA, every
child chromosome was evaluated in each generation and
be able to cover more search space.
C. Parameter Setting
In our experiment, a number of items in knapsack
problem are equal to 100 and we randomly assign value
and weight to items from [0,100]. Then, we assign weight
to knapsack by summarizing all item weights and divide
them by 2. For MGA and GA, we set a mutation rate in
leading strand equal to 0 and 0.2 in lagging strand
(mutation rate in GA is depending on lagging strand’s
mutation rate). In addition, we set a crossover rate equal
Figure 6. A Comparison of Maximum and Average Fitness Value
to 1 while a number of populations are 100. We run the between GA and MGA utilizing a Crossover on Leading Strand.
process in 300 generation and repeat the processes 10
times. In each round, we also randomly assign weight and Case 3. We observed MGA performance using
value to item in knapsack problem. crossover on leading strand and crossover on lagging
strand. We found that MGA with crossover on leading
V. EXPERIMENT RESULTS strand gives the maximum fitness better than MGA with
crossover on lagging strand because of chromosome
Case 1. After we conducted a crossover step on diversity.
lagging strand in MGA and compared the results with However, an average fitness value in MGA crossover
GA, we found that maximum and average fitness value of on leading strand can cover less search space than MGA
MGA is greater than GA because of chromosome crossover on lagging strand. This is because MGA
diversity. By this strategy, it can provide chromosomes crossover on lagging strand produces the best
with an ability to fast converge to optimal solution (see chromosomes among the ones obtained from crossover
Figure 5). on lagging strand and the good parent chromosomes.
287
a lot lower than MGA. Consequentially, the stability and
the speed in searching are lower. While MGA with the
crossover on lagging strand and crossover on leading
strand have a 0.0789% และ 0.0993% changing rate
respectively. As a result, MGA with the crossover on the
leading strand provide a faster search capacity than the
lagging strand.
288
VI. CONCLUSION [9] Y.H. Song, G.S Wang, A.T. Johns and P.Y. Wang,
“Improved Genetic Algorithms with Fuzzy Logic Controlled
It is known that one serious disadvantage of Genetic Crossover and Mutation,” UKACC International Conference
algorithms in particular is that it is a time consuming on Control, 1996, 1, 2-5 Sept 1996, pp 140-144.
[10] R. Takahashi, “Solving the Traveling Salesman Problem
procedure. However, by applying meiosis cell division
through Genetic Algorithms with Changing Crossover
approach, it is possible to improve the efficiency of GA. Operators,” Fourth International Conference on Machine
In this paper a novel approach to GA efficiency Learning and Applications, 15-17 Dec. 2005, p. 6.
improvement has been presented. As we have shown, this
approach is capable of attaining a substantial
improvement of converging speed. In our experiment, we
conducted 2 sets of crossover strategies, a crossover on
lagging strand and a crossover on leading strand to
generate chromosome diversity. We found that the
evolution of chromosomes in MGA crossover on leading
and lagging strand is faster than GA. That is, MGA can
provide an optimal solution faster than GA.
Moreover, we compared parent preservation strategy
with chromosome diversity strategy. We found that the
later strategy can provide us with an optimal solution
faster than the former due to the reduction of
chromosome diversity by the former strategy in leading
strand. However, we perceived that the parent
preservation strategy gains more stability than the
diversity strategy.
Since both mutation and crossover in MGA are
random processes, it could lead to slow chromosome
evolution. Applying rough set theory [8] or fuzzy logic
[9] to calculate the point of crossover and mutation may
help us improve MGA performance. In addition, we
might be able to obtain fitting chromosomes faster if we
use advanced crossover operators [10].
REFERENCES
289