Adaptive Genetic Algorithm

Abstract

In this paper we introduce an adaptive, 'self-contained' genetic algorithm (GA) with steady-state selection. This variant of GA utilizes empirically based methods for calculating its control parameters. The adaptive algorithm estimates the percentage of the population to be replaced with new individuals (generation gap). It chooses the solutions for crossover and varies the number of mutations, ail regarding the current population state. The state of the population is evaluated by observing some of its characteristic values, such as the best and worst individual's cost function (fitness) values, the population average etc. Furthermore, a non-uniform mutation operator is introduced, which increases the algorithm's efficiency. Adaptive method does not, however, restrict the applicability in any way. The described GA is applied to optimization of several multimodal functions with various degrees of complexity, employed earlier for comparative studies. Some deceptive problems were also taken into consideration, and a comparison between the adaptive and standard genetic algorithm has been made.