kofnGA
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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.3 |
rolling linux/jammy R-4.5 | kofnGA_1.3.tar.gz |
43.4 KiB |
1.3 |
rolling linux/noble R-4.5 | kofnGA_1.3.tar.gz |
43.3 KiB |
1.3 |
rolling source/ R- | kofnGA_1.3.tar.gz |
11.6 KiB |
1.3 |
latest linux/jammy R-4.5 | kofnGA_1.3.tar.gz |
43.4 KiB |
1.3 |
latest linux/noble R-4.5 | kofnGA_1.3.tar.gz |
43.3 KiB |
1.3 |
latest source/ R- | kofnGA_1.3.tar.gz |
11.6 KiB |
1.3 |
2026-04-26 source/ R- | kofnGA_1.3.tar.gz |
11.6 KiB |
1.3 |
2026-04-23 source/ R- | kofnGA_1.3.tar.gz |
11.6 KiB |
1.3 |
2026-04-09 windows/windows R-4.5 | kofnGA_1.3.zip |
46.2 KiB |
1.3 |
2025-04-20 source/ R- | kofnGA_1.3.tar.gz |
11.6 KiB |