Automation of preprocessing often requires computationally costly preprocessing combinations. This package helps to find near-best combinations faster. Metaheuristics supported are taboo search, simulated annealing, reheating and late acceptance. Start conditions include random and grid starts. End conditions include all iteration rounds completed, objective threshold reached and convergence. Metaheuristics, start and end conditions can be hybridized and hyperparameters optimized. Parallel computations are supported. The package is intended to be used with package 'preprocomb' and takes its 'GridClass' object as input.
Version: | 0.2.0 |
Depends: | R (≥ 2.10) |
Imports: | utils, methods, stats, reshape2, ggplot2, preprocomb (≥ 0.3.0), doParallel, foreach |
Suggests: | testthat, knitr, rmarkdown, rpart |
Published: | 2016-06-30 |
Author: | Markus Vattulainen |
Maintainer: | Markus Vattulainen <markus.vattulainen at gmail.com> |
License: | GPL-2 |
NeedsCompilation: | no |
CRAN checks: | metaheur results |
Reference manual: | metaheur.pdf |
Vignettes: |
Metaheur |
Package source: | metaheur_0.2.0.tar.gz |
Windows binaries: | r-devel: metaheur_0.2.0.zip, r-release: metaheur_0.2.0.zip, r-oldrel: metaheur_0.2.0.zip |
OS X El Capitan binaries: | r-release: metaheur_0.2.0.tgz |
OS X Mavericks binaries: | r-oldrel: metaheur_0.2.0.tgz |
Old sources: | metaheur archive |
Please use the canonical form https://CRAN.R-project.org/package=metaheur to link to this page.