Modeling and analysis of genetic algorithm with tournament selection

Abstract

In this paper we propose a mathematical model of a simplified version of genetic algorithm (GA) based on mutation and tournament selection and obtain upper and lower bounds on expected proportion of the individuals with the fitness above certain threshold. As an illustration we consider a GA optimizing the bit-counting function and a GA for the vertex cover problem on graphs of a special structure. The theoretical estimates obtained are compared with experimental results.