论文信息 - Improving the Performance of Genetic Algorithm by Reducing the Population Size

Improving the Performance of Genetic Algorithm by Reducing the Population Size

Generally, in the search process, the entire population is considered in identifying the best population using Genetic Algorithm (GA). It reduces the efficiency of the algorithm if the entire population is considered, because the population has both good and bad individuals. If the population has only good individuals, the performance is improved better. Hence a new PR method is proposed in order to identify the best individuals from the initial population.

Murali Bhaskaran | Vishnu Raja

[1] Seyed Taghi Akhavan Niaki,et al. Statistical Design of Genetic Algorithms for Combinatorial Optimization Problems , 2011 .

[2] Martijn C. Schut,et al. Boosting Genetic Algorithms with Self-Adaptive Selection , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[3] Hong He,et al. A two-stage genetic algorithm for automatic clustering , 2012, Neurocomputing.

[4] David B. Fogel,et al. Evolutionary algorithms in theory and practice , 1997, Complex.

[5] E. Costa,et al. An Evolutionary Approach to the Zero/One Knapsack Problem: Testing Ideas from Biology , 2001 .

[6] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[7] Thomas Bartz-Beielstein,et al. Sequential Parameter Optimization Applied to Self-Adaptation for Binary-Coded Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

[8] Imad Fakhri Taha Alshaikhli. A practical method for the analysis of genetic algorithms , 2011 .

[9] M. Eens,et al. Relationship between population size and genetic diversity in endangered populations of the European bullhead (Cottus gobio): implications for conservation , 2004 .