Decay

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

Decay function

<dl><dt>t</dt>
<dd>Number of objects.</dd>
<dt>lambda</dt>
<dd>Exponential decay constant.</dd></dl>

Arguments

Exponential decay. — Decay

<dl>

<dt>t</dt>
<dd>Number of objects.</dd>


<dt>lambda</dt>
<dd>Exponential decay constant.</dd>

</dl>

Decay: Exponential decay.

Description

Usage

Value

Arguments

See Also

Examples