Installation
About
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.
Citation | kofnGA citation info |
Key Metrics
Downloads
Yesterday | 9 0% |
Last 7 days | 74 -18% |
Last 30 days | 276 +14% |
Last 90 days | 723 -23% |
Last 365 days | 3.280 -16% |