Performance Analysis of Selection Schemes in Genetic Algorithm for Solving Optimization Problem Using De Jong?s Function1

Abstract

Genetic Algorithm (GA) is known to be a search algorithm based on idea of natural selection and survival of fittest [11]. The main idea behind the approach is, for a population of individuals adapting to some environment, they should behave naturally. Genetic Algorithm and other evolutionary algorithms are used over the years for finding solution to different emerging problems which could be better implemented and solved using approach of Genetic algorithm. Out of many such problems optimization problems are having their own importance and had a great scope for further research. There are different solutions given by different researchers for finding solutions to such optimization problems. This paper is about using De jong?s function 1 adopted for finding a solution to an optimization problem and thereby comparing the performance of chosen selection schemes used in Genetic Algorithm