mutationBinaryCycle

Given a population of bit-strings, this function mutates all 
individuals by cyclical shifting the string to the right or left.

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

Martin Zaefferer

CEGO

Combinatorial Efficient Global Optimization

mutationBinaryCycle 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

Cycle Mutation for Bit-strings — mutationBinaryCycle

<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>

mutationBinaryCycle: Cycle Mutation for Bit-strings

Description

Usage

Value

Arguments