xegaPermMutateGeneGreedy

<code>xegaPermMutateGeneGreedy</code> mutates a permutation 
 by inserting a greedy path of length <code>k</code> 
 at a random position <code>start</code>.

An implementation of
representation-dependent gene level operations for
genetic algorithms with genes representing permutations:
Initialization of genes, mutation, and crossover.
The crossover operation provided is position-based crossover
(Syswerda, G., Chap. 21 in Davis, L. (1991, ISBN:0-442-00173-8).
For mutation, several variants are included: Order-based mutation
(Syswerda, G., Chap. 21 in Davis, L. (1991, ISBN:0-442-00173-8),
randomized Lin-Kernighan heuristics
(Croes, G. A. (1958) <doi:10.1287/opre.6.6.791> and
Lin, S. and Kernighan. B. W. (1973)
<doi:10.1287/opre.21.2.498>),
and randomized greedy operators.
A random mix operator for mutation selects a mutation variant
randomly.

Andreas Geyer-Schulz

xegaPermGene

Operations on Permutation Genes

xegaPermMutateGeneGreedy function

<dl><dt>gene</dt>
<dd>A Permutation.</dd>
<dt>lF</dt>
<dd>Local configuration of the genetic algorithm.</dd></dl>

Arguments

Mutate a gene (by inserting a greedy path at a random start position with a random length of k). — xegaPermMutateGeneGreedy

<dl>

<dt>gene</dt>
<dd>A Permutation.</dd>


<dt>lF</dt>
<dd>Local configuration of the genetic algorithm.</dd>

</dl>

xegaPermMutateGeneGreedy: Mutate a gene (by inserting a greedy path at a random start position with a random length of k).

Description

Usage

Value

Arguments

Details

See Also

Examples