xegaPermCross2Gene

<code>xegaPermCross2Gene</code> determines 
 a random subschedule of random length. 
It copies the random subschedule into a new gene.
 The rest of the positions of the new scheme is filled 
 with the elements of the other gene to complete the
 permutation. This is done for each gene.

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

xegaPermCross2Gene function

<dl><dt>gg1</dt>
<dd>Permutation.</dd>
<dt>gg2</dt>
<dd>Permutation.</dd>
<dt>lF</dt>
<dd>Local configuration of the genetic algorithm.</dd></dl>

Arguments

Position-based crossover of 2 genes. — xegaPermCross2Gene

<dl>

<dt>gg1</dt>
<dd>Permutation.</dd>


<dt>gg2</dt>
<dd>Permutation.</dd>


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

</dl>

xegaPermCross2Gene: Position-based crossover of 2 genes.

Description

Usage

Value

Arguments

References

See Also

Examples