xegaGaGeneMapPerm

<code>xegaGaGeneMapPerm()</code> maps 
 the bit strings of a binary string 
 to a permutation of integers.
 Example: Traveling Salesman Problem (TSP).

Representation-dependent gene level operations of a
genetic algorithm with binary coded genes
for the R-package 'xega' <https://CRAN.R-project.org/package=xega>:
Initialization of random binary genes, several gene maps for
binary genes, several mutation operators, several crossover
operators with 1 and 2 kids, replication
pipelines for 1 and 2 kids, and, last but not least, function
factories for configuration.
See Goldberg, D. E. (1989, ISBN:0-201-15767-5).
For crossover operators, see
Syswerda, G. (1989, ISBN:1-55860-066-3),
Spears, W. and De Jong, K. (1991, ISBN:1-55860-208-9).
For mutation operators, see
Stanhope, S. A. and Daida, J. M. (1996, ISBN:0-18-201-031-7).
For 'xega''s architecture,
see Geyer-Schulz, A. (2025) <doi:10.5445/IR/1000187255>.

Andreas Geyer-Schulz

xegaGaGene

Binary Gene Operations for Genetic Algorithms

xegaGaGeneMapPerm function

<dl><dt>gene</dt>
<dd>A binary gene (the genotype).</dd>
<dt>penv</dt>
<dd>A problem environment.</dd></dl>

Arguments

Map the bit strings of a binary gene to a permutation. — xegaGaGeneMapPerm

<dl>

<dt>gene</dt>
<dd>A binary gene (the genotype).</dd>


<dt>penv</dt>
<dd>A problem environment.</dd>

</dl>

xegaGaGeneMapPerm: Map the bit strings of a binary gene to a permutation.

Description

Usage

Value

Arguments

See Also

Examples