mutationBinaryBitFlip

Given a population of bit-strings, this function mutates all 
individuals by randomly inverting one or more bits in each individual.

Model building, surrogate model
based optimization and Efficient Global Optimization in combinatorial
or mixed search spaces.

Martin Zaefferer

CEGO

Combinatorial Efficient Global Optimization

mutationBinaryBitFlip function

<dl><dt>population</dt>
<dd>List of bit-strings</dd>
<dt>parameters</dt>
<dd>list of parameters: parameters$mutationRate =&gt; mutation rate, specifying number of bits flipped. Should be in range between zero and one</dd></dl>

Arguments

Bit-flip Mutation for Bit-strings — mutationBinaryBitFlip

<dl>

<dt>population</dt>
<dd>List of bit-strings</dd>


<dt>parameters</dt>
<dd>list of parameters: parameters$mutationRate =&gt; mutation rate, specifying number of bits flipped. Should be in range between zero and one</dd>

</dl>

mutationBinaryBitFlip: Bit-flip Mutation for Bit-strings

Description

Usage

Value

Arguments