Non-stationary optimization with the immune based algorithms is studied in this paper. The algorithm works with a binary representation of solutions. A set of different types of binary mutation is proposed and experimentally verified. The mutations differ in the way of calculation of the number of bits to be mutated. Obtained results allow to indicate the leading formulas of calculation.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.