You are using an outdated browser Internet Explorer. It does not support some functions of the site.

Recommend that you install one of the following browsers: Firefox, Opera or Chrome.


+7 961 270-60-01

  • Dynamic norms of random and directed mutations in the genetic algorithm

    Dynamic norms for random and directed mutations in a genetic algorithm for solving the problem of placing elements in an orthonormal lattice have been developed. The principle of these norms is borrowed from the method of imitation annealing. The probability of using random mutations decreases in accordance with the annealing temperature, and the probability of directional mutations increases from iteration to iteration when approaching the optimum.

    Keywords: genetic algorithm, the task of placing the elements, the annealing method, random mutations, directed deterministic mutations