Analysis of the Effect of Elite Count on the Behavior of Genetic Algorithms: A Perspective

Abstract

Various parameters affect the performance of Genetic Algorithms in terms of the accuracy of the optimal solution achieved and convergence rate. In this paper, effect of one such important parameter (elite count) on the behavior of Genetic Algorithms is meticulously analyzed, A standard benchmark function 'Rastrigin's Function' is used for the purpose of the study, and the results indicate that the extremely high values of elite count result in premature convergence on local minima, while low values of elite count result in much better solutions, near to the global optima.

Showing 1-10 of 13 references

Analysis of the Effect of Defining Length and Order of Schemata on Probability of Survival of a Group of Schemata

  • A. Mishra, A. Shukla
  • 2016
1 Excerpt

A Genetic Algorithm-Based Moving Object Detection for Real-time Traffic Surveillance

  • G. Lee, R. Mallipeddi
  • 2015
1 Excerpt

A survey of genetic algorithms for solving multi depot vehicle routing problem

  • S. Karakati, V. Podgorelec
  • 2014

An overview of schema theory

  • D. White
  • 2014
1 Excerpt