The dynamics of a changing range genetic algorithm

✍ Scribed by Adil Amirjanov

• Publisher: John Wiley and Sons
• Year: 2009
• Tongue: English
• Weight: 173 KB
• Volume: 81
• Category: Article
• ISSN: 0029-5981
• DOI: 10.1002/nme.2716

✦ Synopsis

Abstract

The formalism is presented for modelling of a genetic algorithm (GA) with an adjustment of a search space size, which assumes that the environment and the population form a unique system; it establishes a dynamic balance and convergence towards an optimal solution. The paper describes the effect of an adjustment of a search space size of GA on the macroscopic statistical properties of population such as the average fitness and the variance fitness of population. The equations of motion were derived for the one‐max problem that expressed the macroscopic statistical properties of population after reproductive genetic operators and an adjustment of a search space size in terms of those prior to the operation. Predictions of the theory are compared with experiments and are shown to predict the average fitness and the variance fitness of the final population accurately. Copyright © 2009 John Wiley & Sons, Ltd.