mutBitflip

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.

Framework for building evolutionary algorithms for both single- and multi-objective continuous or discrete optimization problems. A set of predefined evolutionary building blocks and operators is included. Moreover, the user can easily set up custom objective functions, operators, building blocks and representations sticking to few conventions. The package allows both a black-box approach for standard tasks (plug-and-play style) and a much more flexible white-box approach where the evolutionary cycle is written by hand.

Jakob Bossek

Evolutionary Computation in R

Michael H. Buselli

Wessel Dankers

Carlos M. Fonseca

Manuel Lopez-Ibanez

Luis Paquete

Joshua Knowles

Eckart Zitzler

Olaf Mersmann

mutBitflip function

<dl><dt>ind</dt>
<dd>[<code>binary</code>] 
Binary vector, i.e., vector with elements 0 and 1 only.</dd>
<dt>p</dt>
<dd>[<code>numeric(1)</code>] 
Probability to flip a single bit.
Default is <code>0.1</code>.</dd></dl>

Arguments

Bitplip mutator. — mutBitflip

<dl>

<dt>ind</dt>
<dd>[<code>binary</code>] 
Binary vector, i.e., vector with elements 0 and 1 only.</dd>


<dt>p</dt>
<dd>[<code>numeric(1)</code>] 
Probability to flip a single bit.
Default is <code>0.1</code>.</dd>

</dl>

mutBitflip: Bitplip mutator.

Description

Usage

Value

Arguments

References

See Also