Evolutionary computation
Speeding up evolutionary algorithms through asymmetric mutation operators
Evolutionary Computation
Hi-index | 0.00 |
Experimental and analytical investigations are performed for OneMax problem using Wright---Fisher model. This study investigates the distribution of the first order schema frequency in the evolution process of Genetic Algorithm (GA). Effects of mutation in GA are analyzed for the standard mutation and asymmetric mutation models. If a population is in linkage equilibrium, it can be shown that OneMax problem is equivalent to the asymmetric mutation model. Thus, we can apply theoretical results obtained in the asymmetric mutation model to OneMax problem and investigate the convergence time of GA calculation within the framework of Wright---Fisher model.