|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ПсковГУ |
||
Genetic algorithm (GA) is a highly popular derivative-free optimization method that is widely used in real-world tasks. There are numerous studies on GA modifications aimed at improving its search efficiency. Gender GA (GGA) is one of them. GGA divides population into two parts (genders) with high and low mutation rate and constrains crossover of individuals of the same gender. Typically, all new modifications of GGA are validated with computational experiments on a list of problems. This provides practical knowledge about the performance of new modifications, but not a general understanding of the effectiveness of gender introduction. In this study, we consider binary-coded GGA using Holand’s schema theory. Comparison of the growth values for different schemata orders o(H) showed GGA superiority over standard GA. This result does not require problem specifying and pretends to become theoretical evidence of GGA supremacy over GA. Another interesting result of this study lies in the field of biology: the obtained superiority of GGA over GA may describe the advantage of genderized species over non-genderized. Along with the Red Queen hypothesis, it can be treated as an additional explanation of sexual reproduction advantage. However, since GGA represents a highly simplified biological evolution process of genderized species, it should be treated with a share of skepticism and requires further investigation.