Genetic Algorithm Based on Sorting Techniques

Parul Aggrawal^1, , Faisal Naved¹ and Mohd Haider¹

¹Department of Computer Science, Jamia Hamdard University, New Delhi-62, India

Cite this paper:
Parul Aggrawal, Faisal Naved and Mohd Haider. Genetic Algorithm Based on Sorting Techniques. Journal of Computer Sciences and Applications. 2015; 3(2):40-45. doi: 10.12691/jcsa-3-2-4

Abstract

Genetic Algorithm, an Artificial Intelligence approach is based on the theory of natural selection and evolution. Traditional methods of sorting data are too slow in finding an efficient solution when the input data is too large. In contrast, Genetic Algorithm generates fittest solutions to a problem by exploiting new regions in the search space. This paper targets the three most commonly used Bubble, Selection and Insertion sorting techniques and executes memory on an input ranging from 1,000 to 10,000 where the input is entered in increasing, decreasing and random order. It mainly uses the Genetic Algorithm approach to optimize the effect of the three algorithms by generating an output which is consistent in terms of time variations which is not otherwise. This has been achieved by exploiting the property of Genetic Algorithm by choosing best parameter for population size, encoding, selection criteria, operator choice and optimized fitness function.

Keywords:
genetic algorithm sorting selection crossover mutation

This work is licensed under a Creative Commons Attribution 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

References:

[1]	D. Goldberg. Genetic Algorithms in Search, Optimization, and Machine
[2]	Learning. Addison-Wesley, Reading, MA, 1989. [2] David E.Goldberg,” Genetic Algorithms in search, optimization and machine learning 1st, Addison-Wesley Longman Publishing Co., Inc. Boston ©1989
[3]	H. Bhasin and Neha Singla, “Cellular Genetic Test Data Generation”, ACM SIGSOFT Software Enginnering Notes, Vol. 38 (5), September 2013, Pages 1-9.
[4]	Introduction to Algorithm, Second Edition Thomas H.Cormen, Charles E.Leiserson, Ronald L.Rivest, Clifford Stein, Mc-Graw Hill Publications
[5]	H. Bhasin, “Cost Priority Cognizant Regression Testing”, ACM SIGSOFT Software Enginnering Notes, Vol. 39 (3), May 2014, Pages 1-7.
[6]	T. Back, D. B. Fogel, and Z. Michalewicz. Evolutionary Computation Vol. I & II. Institute of Physics Publishing, 2000.