kofnGA: A Genetic Algorithm for Fixed-Size Subset Selection

Function kofnGA uses a genetic algorithm to choose a subset of a fixed size k from the integers 1:n, such that a user-supplied objective function is minimized at that subset. The selection step is done by tournament selection based on ranks, and elitism may be used to retain a portion of the best solutions from one generation to the next.

Version: 1.1
Published: 2015-02-04
Author: Mark A. Wolters
Maintainer: Mark A. Wolters <mark at mwolters.com>
License: GPL-2
NeedsCompilation: no
Citation: kofnGA citation info
In views: Optimization
CRAN checks: kofnGA results

Downloads:

Reference manual: kofnGA.pdf
Package source: kofnGA_1.1.tar.gz
Windows binaries: r-devel: kofnGA_1.1.zip, r-release: kofnGA_1.1.zip, r-oldrel: kofnGA_1.1.zip
OS X Snow Leopard binaries: r-release: kofnGA_1.1.tgz, r-oldrel: kofnGA_1.1.tgz
OS X Mavericks binaries: r-release: kofnGA_1.1.tgz
Old sources: kofnGA archive