A Genetic Algorithm for Fixed-Size Subset Selection

Provides a function that uses a genetic algorithm to search for a subset of 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. Population objective function values may optionally be evaluated in parallel.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.3 by Mark A. Wolters, 6 months ago

Browse source code at https://github.com/cran/kofnGA

Authors: Mark A. Wolters [aut, cre]

Documentation:   PDF Manual  

Task views: Optimization and Mathematical Programming

GPL-2 license

Imports bigmemory

See at CRAN