mutationPermutationInsert

Given a population of permutations, this function mutates all 
individuals by randomly selecting two indices.
The element at index1 is moved to positition index2, other elements

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

Martin Zaefferer

CEGO

Combinatorial Efficient Global Optimization

mutationPermutationInsert function

<dl><dt>population</dt>
<dd>List of permutations</dd>
<dt>parameters</dt>
<dd>list of parameters, currently only uses parameters$mutationRate, 
which should be between 0 and 1 (but can be larger than 1). The mutation rate determines the number of reversals
performed, relative to the permutation length (N). 0 means none. 1 means N reversals.
The default is 1/N.</dd></dl>

Arguments

Insert Mutation for Permutations — mutationPermutationInsert

<dl>

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


<dt>parameters</dt>
<dd>list of parameters, currently only uses parameters$mutationRate, 
which should be between 0 and 1 (but can be larger than 1). The mutation rate determines the number of reversals
performed, relative to the permutation length (N). 0 means none. 1 means N reversals.
The default is 1/N.</dd>

</dl>

mutationPermutationInsert: Insert Mutation for Permutations

Description

Usage

Value

Arguments