mutationBinarySingleBitFlip

Given a population of bit-strings, this function mutates all 
individuals by randomly inverting one bit in each individual. 
Due to the fixed mutation rate, this is computationally faster.

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

Martin Zaefferer

CEGO

Combinatorial Efficient Global Optimization

mutationBinarySingleBitFlip function

<dl><dt>population</dt>
<dd>List of bit-strings</dd>
<dt>parameters</dt>
<dd>not used</dd></dl>

Arguments

Single Bit-flip Mutation for Bit-strings — mutationBinarySingleBitFlip

<dl>

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


<dt>parameters</dt>
<dd>not used</dd>

</dl>

mutationBinarySingleBitFlip: Single Bit-flip Mutation for Bit-strings

Description

Usage

Value

Arguments