A Proposed Genetic Algorithm Selection Method

Genetic algorithms (GAs) are stochastic search meth ods that mimic natural biological evolution. Genet ic algorithms are broadly used in optimisation problem s. They facilitate a good alternative in problem are as where the number of constraints is too large for humans to ef fici ntly evaluate. This paper presents a new selection method for genet ic algorithms. The new method is tested and compare d with the Geometric selection method. Simulation studies show remarkable performance of the proposed GA sele ction method .The proposed selection method is simple to i mplement, and it has notable ability to reduce the eff cted of premature convergence compared to other method. The proposed GAs selection method is expected to hel p in solving hard problems quickly, reliably, and a ccurately

[1]  Thomas Bäck,et al.  Extended Selection Mechanisms in Genetic Algorithms , 1991, ICGA.

[2]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[3]  David E. Goldberg,et al.  Combining competent crossover and mutation operators: a probabilistic model building approach , 2005, GECCO '05.

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  Lothar Thiele,et al.  A Comparison of Selection Schemes used in Genetic Algorithms , 1995 .

[6]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[7]  S. Burkhardt,et al.  Monroe E. Price / Daniel Dayan (Hrsg.) (2008): Owning the Olympics. Narratives of the New China. Ann Arbor: The University of Michigan Press , 2008 .

[8]  Annie S. Wu,et al.  Putting More Genetics into Genetic Algorithms , 1998, Evolutionary Computation.

[9]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[10]  Zbigniew Michalewicz,et al.  Parameter Control in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

[11]  J. F. Price,et al.  On descent from local minima , 1971 .

[12]  Sean Luke,et al.  Modification Point Depth and Genome Growth in Genetic Programming , 2003, Evolutionary Computation.

[13]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[14]  F. H. Branin.  Widely convergent method for finding multiple solutions of simultaneous nonlinear equations , 1972 .