Package website: release
This package provides a common framework for optimization including
Optimizer
: Objects of this class allow you to optimize an object of the classOptimInstance
.OptimInstance
: Defines the optimization problem, consisting of anObjective
, thesearch_space
and aTerminator
. All evaluations on theOptimInstance
will be automatically stored in its ownArchive
.Objective
: Objects of this class contain the objective function. The class ensures that the objective function is called in the right way and defines, whether the function should be minimized or maximized.Terminator
: Objects of this class control the termination of the optimization independent of the optimizer.
Various optimization methods are already implemented e.g. grid search, random search and generalized simulated annealing.
CRAN version
install.packages("bbotk")
Development version
remotes::install_github("mlr-org/bbotk")
library(bbotk)
library(paradox)
# Define objective function
fun = function(xs) {
c(y = - (xs[[1]] - 2)^2 - (xs[[2]] + 3)^2 + 10)
}
# Set domain
domain = ParamSet$new(list(
ParamDbl$new("x1", -10, 10),
ParamDbl$new("x2", -5, 5)
))
# Set codomain
codomain = ParamSet$new(list(
ParamDbl$new("y", tags = "maximize")
))
# Create Objective object
obfun = ObjectiveRFun$new(
fun = fun,
domain = domain,
codomain = codomain,
properties = "deterministic"
)
# Define termination criterion
terminator = trm("evals", n_evals = 20)
# Create optimization instance
instance = OptimInstanceSingleCrit$new(
objective = obfun,
terminator = terminator
)
# Load optimizer
optimizer = opt("gensa")
# Trigger optimization
optimizer$optimize(instance)
# View results
instance$result