ANALYSIS OF TAKEOVER TIME FOR GENETIC ALGORITHMS

In genetic algorithm, the selection operator occupies an important position. The character of selection operator depends on takeover time. In this paper, the strict definition of takeover time is shown. The takeover time of selection operator based on proportion is expressed so it is proved that the rank of takeover time is O （ln N ）, and it does not depend on specific form of fitness function or initial population distribution. The takeover time coefficient is given, so the influence of different selection operators and transformation of fitness function can be measured quantitatively. The effect of usual transformation on fitness function is also analyzed.