mutBitflip {ecr}

Bitplip mutator.

Description

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.

Usage

mutBitflip(ind, p = 0.1)

Arguments

ind

[binary]
Binary vector, i.e., vector with elements 0 and 1 only.

p

[numeric(1)]
Probability to flip a single bit. Default is 0.1.

Value

[binary]

References

[1] Eiben, A. E. & Smith, James E. (2015). Introduction to Evolutionary Computing (2nd ed.). Springer Publishing Company, Incorporated. 52.

See Also

Other mutators: mutGauss(), mutInsertion(), mutInversion(), mutJump(), mutPolynomial(), mutScramble(), mutSwap(), mutUniform()