The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
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.
Version: | 1.0.0.1 |
Imports: | xegaSelectGene |
Suggests: | testthat (≥ 3.0.0) |
Published: | 2025-04-16 |
DOI: | 10.32614/CRAN.package.xegaPermGene |
Author: | Andreas Geyer-Schulz
|
Maintainer: | Andreas Geyer-Schulz <Andreas.Geyer-Schulz at kit.edu> |
License: | MIT + file LICENSE |
URL: | https://github.com/ageyerschulz/xegaPermGene |
NeedsCompilation: | no |
Materials: | README NEWS |
CRAN checks: | xegaPermGene results |
Reference manual: | xegaPermGene.pdf |
Package source: | xegaPermGene_1.0.0.1.tar.gz |
Windows binaries: | r-devel: xegaPermGene_1.0.0.1.zip, r-release: xegaPermGene_1.0.0.1.zip, r-oldrel: xegaPermGene_1.0.0.1.zip |
macOS binaries: | r-release (arm64): xegaPermGene_1.0.0.1.tgz, r-oldrel (arm64): xegaPermGene_1.0.0.1.tgz, r-release (x86_64): xegaPermGene_1.0.0.1.tgz, r-oldrel (x86_64): xegaPermGene_1.0.0.1.tgz |
Old sources: | xegaPermGene archive |
Reverse imports: | xega |
Please use the canonical form https://CRAN.R-project.org/package=xegaPermGene to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.