A New Selection method for Genetic Algorithm

Genetic algorithms are stochastic search methods for optimization problems. They facilitate a good alternative in problem areas where the number of constraints is too large to efficiently evaluate. Selection can be a very significant factor in determining the performance of genetic algorithms. This paper presents a new selection method for genetic algorithms. The new selection method reduces the loss of diversity and to help in solving hard problems quickly, reliably, and accurately. The new method is tested and compared with the selection methods on brachistochrone problem. Simulation studies show remarkable performance of the proposed GA selection method

Keywords:

Genetic Algorithm , Optimization , genetic operation , Selection method