This operator works only on binary representation and flips each bit with a given probability \(p \in (0, 1)\). Usually it is recommended to set \(p = \frac{1}{n}\) where \(n\) is the number of bits in the representation.
mutBitflip(ind, p = 0.1)
ind | [ |
---|---|
p | [ |
[binary
]
Other mutators: mutGauss
,
mutInsertion
, mutPolynomial
,
mutScramble
, mutSwap
,
mutUniform