The hardware and bandwidth for this mirror is donated by dogado GmbH, the Webhosting and Full Service-Cloud Provider. Check out our Wordpress Tutorial.
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[@]dogado.de.
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.
| Version: | 1.3 |
| Imports: | bigmemory |
| Published: | 2018-11-02 |
| Author: | Mark A. Wolters [aut, cre] |
| Maintainer: | Mark A. Wolters <mark at mwolters.com> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| Citation: | kofnGA citation info |
| In views: | Optimization |
| CRAN checks: | kofnGA results |
| Reference manual: | kofnGA.pdf |
| Package source: | kofnGA_1.3.tar.gz |
| Windows binaries: | r-devel: kofnGA_1.3.zip, r-release: kofnGA_1.3.zip, r-oldrel: kofnGA_1.3.zip |
| macOS binaries: | r-release (arm64): kofnGA_1.3.tgz, r-oldrel (arm64): kofnGA_1.3.tgz, r-release (x86_64): kofnGA_1.3.tgz, r-oldrel (x86_64): kofnGA_1.3.tgz |
| Old sources: | kofnGA archive |
| Reverse imports: | secrdesign |
Please use the canonical form https://CRAN.R-project.org/package=kofnGA 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.
Health stats visible at Monitor.