Population diversity of non-elitist evolutionary algorithms in the exploration phase
Jarosław Arabas , Karol Opara
AbstractThe paper discusses the genetic diversity of real-coded populations processed by an evolutionary algorithm (EA). Diversity is expressed as a variance or a covariance matrix of individuals contained in the population, in one-or multidimensional cases, respectively. We focus on the exploration stage of the optimization, therefore the fitness function is modeled as noise. We prove that the expected value of genetic diversity achieves a level proportional to the mutation covariance matrix. The proportionality coefficient depends solely on the EA parameters. Formulas are derived to predict the diversity for fitness proportionate, tournament and truncation selection, with and without arithmetic crossover and with Gaussian mutation. Experimental validation of the multidimensional case shows that prediction accuracy is satisfactory in a broad spectrum of settings of EA parameters.
|Journal series||IEEE Transactions On Evolutionary Computation, ISSN 1089-778X, (N/A 200 pkt)|
|Publication size in sheets||0.3|
|Keywords in English||evolutionary algorithm , population diversity , noise fitness model.|
|ASJC Classification||; ;|
|Score||= 200.0, 13-12-2019, ArticleFromJournal|
|Publication indicators||: 2018 = 4.854; : 2018 = 8.508 (2) - 2018=10.364 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.