Nothing
Provides a function that uses a genetic algorithm to search for a subset of size k from the integers 1:n, such that a usersupplied 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.
Package details 


Author  Mark A. Wolters [aut, cre] 
Maintainer  Mark A. Wolters <[email protected]> 
License  GPL2 
Version  1.3 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.