论文信息 - Comparison of Performance between Different Selection Strategies on Simple Genetic Algorithms

Comparison of Performance between Different Selection Strategies on Simple Genetic Algorithms

This paper presents the comparison of performance on a simple genetic algorithm (SGA) using roulette wheel selection and tournament selection. A SGA is mainly composed of three genetic operations, which are selection, crossover and mutation. With the same crossover and mutation operation, the simulation results are studied by comparing different selection strategies which are discussed in this paper. Qualitative analysis of the selection strategies is depicted, and the numerical experiments show that SGA with tournament selection strategy converges much faster than roulette wheel selection

[1] De-Shuang Huang,et al. Dilation method for finding close roots of polynomials based on constrained learning neural networks , 2003 .

[2] De-Shuang Huang,et al. A Neural Root Finder of Polynomials Based on Root Moments , 2004, Neural Computation.

[3] De-Shuang Huang,et al. A constructive approach for finding arbitrary roots of polynomials by neural networks , 2004, IEEE Transactions on Neural Networks.

[4] De-Shuang Huang,et al. Determining the centers of radial basis probabilistic neural networks by recursive orthogonal least square algorithms , 2005, Appl. Math. Comput..

[5] De-Shuang Huang,et al. Zeroing polynomials using modified constrained neural network approach , 2005, IEEE Transactions on Neural Networks.

[6] Wan-Chi Siu,et al. A case study for constrained learning neural root finders , 2005, Appl. Math. Comput..

[7] Ali M. S. Zalzala,et al. Recent developments in evolutionary and genetic algorithms: theory and applications , 1997 .

[8] Kwang Y. Lee,et al. Optimization method for reactive power planning by using a modified simple genetic algorithm , 1995 .

[9] Wael Mustafa. Optimization of Production Systems Using Genetic Algorithms , 2003, Int. J. Comput. Intell. Appl..