CFP last date
20 December 2024
Reseach Article

Analysis of Effect of Varying Crossover Points on Simple Genetic Algorithm (SGA)

Published on October 2014 by Pradeep Kanchan, Rashmi Adyapady R
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.

@article{
author = { Pradeep Kanchan, Rashmi Adyapady R },
title = { Analysis of Effect of Varying Crossover Points on Simple Genetic Algorithm (SGA) },
journal = { International Conference on Information and Communication Technologies },
issue_date = { October 2014 },
volume = { ICICT },
number = { 2 },
month = { October },
year = { 2014 },
issn = 0975-8887,
pages = { 1-4 },
numpages = 4,
url = { /proceedings/icict/number2/17965-1409/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Information and Communication Technologies
%A Pradeep Kanchan
%A Rashmi Adyapady R
%T Analysis of Effect of Varying Crossover Points on Simple Genetic Algorithm (SGA)
%J International Conference on Information and Communication Technologies
%@ 0975-8887
%V ICICT
%N 2
%P 1-4
%D 2014
%I International Journal of Computer Applications
Abstract

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.

References
  1. Kanchan, Pradeep, D'souza Rio, "SGA implementation using integer arrays for storage of binary strings", International Conference on Machine Learning and Computing (ICMLC), 2010.
  2. Koza, John R. , "Evolving a computer program to generate random numbers using the Genetic Programming paradigm", Proceedings of the Fourth International Conference on Genetic Algorithms, 1991.
  3. Khan, Fozia Hanif, Khan, Nasiruddin, Inayatulla, Syed, Nizami, Shaikh Tajuddin, "Solving ISP problem by using Genetic Algorithm", International Journal of Basic &amp; Applied Sciences IJBAS-IJENS, Vol:09 No:10.
  4. Koza, John R. , "Genetic Programming: A paradigm for genetically breeding populations of computer programs to solve problems", Proceedings of the 2nd International IEEE Conference on tools for Artificial Intelligence, 1990.
  5. Mitchell, Melanie, "An Introduction to Genetic Algorithms", 1998 :Prentice Hall.
  6. Goldberg, David E. , "Genetic Algorithms in search, Optimization and Machine Learning", 1989 :Addison-Wesley.
  7. Davis, L. , "Genetic algorithms and simulated annealing", 1987 :Pittman.
  8. Holland, J. H. , "Adaptation in natural and artificial systems", 1975 :University of Michigan Press.
Index Terms

Computer Science
Information Sciences

Keywords

Binary Strings Fitness Function Crossover Mutation Crossover Probability Mutation Probability