MODELLING THE DYNAMICS OF AN ADJUSTMENT OF A SEARCH SPACE SIZE IN A GENETIC ALGORITHM
Adil Amirjanov · International Journal of Modern Physics C · 2008
One way to improve a search strategy in a Genetic Algorithm (GA) is to reduce the search space towards the feasible region where the global optimum is located. 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 set of equations of motion was derived for the one-max problem that expressed the macroscopic statistical properties of population after an adjustment of a search space size in terms of those prior to the operation.