mutationStringRandomChange

Given a population of strings, this function mutates all 
individuals by randomly changing an element of the string.

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

Martin Zaefferer

CEGO

Combinatorial Efficient Global Optimization

mutationStringRandomChange function

<dl><dt>population</dt>
<dd>List of permutations</dd>
<dt>parameters</dt>
<dd>list of parameters, with <code>parameters$mutationRate</code> and <code>parameters$lts</code>.
<code>parameters$mutationRate</code> should be between 0 and 1 (but can be larger than 1). The mutation rate determines the number of interchanges
performed, relative to the permutation length (N). 0 means none. 1 means N interchanges.
The default is 1/N. <code>parameters$lts</code> are the possible letters in the string.</dd></dl>

Arguments

Mutation for Strings — mutationStringRandomChange

<dl>

<dt>population</dt>
<dd>List of permutations</dd>


<dt>parameters</dt>
<dd>list of parameters, with <code>parameters$mutationRate</code> and <code>parameters$lts</code>.
<code>parameters$mutationRate</code> should be between 0 and 1 (but can be larger than 1). The mutation rate determines the number of interchanges
performed, relative to the permutation length (N). 0 means none. 1 means N interchanges.
The default is 1/N. <code>parameters$lts</code> are the possible letters in the string.</dd>

</dl>

mutationStringRandomChange: Mutation for Strings

Description

Usage

Value

Arguments