International Conference on Information and Communication Technologies |
Foundation of Computer Science USA |
ICICT - Number 2 |
October 2014 |
Authors: Pradeep Kanchan, Rashmi Adyapady R |
94b77753-1ead-4ba0-ae83-e2e86b2905c1 |
Pradeep Kanchan, Rashmi Adyapady R . Analysis of Effect of Varying Crossover Points on Simple Genetic Algorithm (SGA). International Conference on Information and Communication Technologies. ICICT, 2 (October 2014), 1-4.
The genetic algorithm (GA) is an optimization and search technique based on the principles of genetics and natural selection. A genetic algorithm is a search method that can be used for both solving problems and modeling evolutionary systems. The concept of the proposed paper is taken from simple genetic algorithm implementation using integer arrays for storage of binary strings as a basic ingredient. The Simple genetic algorithm (SGA) evaluates a group of binary strings and it performs crossover and mutation operation, which is the most important operation of genetic algorithm. SGA is successful if the final average fitness value is more than the initial average fitness value after crossover and mutation. This proposed paper deals with varying crossover points and observing its effect on SGA. Basically, the crossover point is varied from 1 to n (where n<=2) and observe its effect on both initial and final average fitness value. The probabilities of crossover and mutation are also varied. Then the proposed paper, Analysis of effect of varying crossover points on simple genetic algorithm is compared with the simple genetic algorithm implementation using integer arrays for storage of binary strings. Experimental results show that the proposed scheme significantly improves the performance of genetic algorithm.