P - the optimization problem typeT - the minimizer type for local searchpublic class LocalSearchCellFactory<P extends OptimProblem,T extends Minimizer<OptimProblem,IterativeMinimizer<Vector>>> extends SimpleCellFactory
LocalSearchCellFactory produces LocalSearchCellFactory.LocalSearchCells.
A LocalSearchCellFactory.LocalSearchCell is a chromosome for a real valued function (an optimization problem) and a candidate solution.
Its mutation operation is by a local minimization method, Nelder-Mead, BFGS, searching the neighborhood of the current solution.| Modifier and Type | Class and Description |
|---|---|
class |
LocalSearchCellFactory.LocalSearchCell
A
LocalSearchCell implements the two genetic operations. |
static interface |
LocalSearchCellFactory.MinimizerFactory<U extends Minimizer<OptimProblem,IterativeMinimizer<Vector>>>
This factory constructs a new
Minimizer for each mutation operation. |
SimpleCellFactory.SimpleCelluniform| Constructor and Description |
|---|
LocalSearchCellFactory(LocalSearchCellFactory.MinimizerFactory<T> factory,
RandomLongGenerator uniform)
Construct an instance of a
LocalSearchCellFactory. |
| Modifier and Type | Method and Description |
|---|---|
LocalSearchCellFactory.LocalSearchCell |
getSimpleCell(RealScalarFunction f,
Vector x)
Construct an instance of a
SimpleCell. |
public LocalSearchCellFactory(LocalSearchCellFactory.MinimizerFactory<T> factory, RandomLongGenerator uniform)
LocalSearchCellFactory.factory - a factory that generates a new instance of a Minimizer for local searchuniform - a uniform random number generatorpublic LocalSearchCellFactory.LocalSearchCell getSimpleCell(RealScalarFunction f, Vector x)
SimpleCellFactorySimpleCell.getSimpleCell in class SimpleCellFactoryf - a real-valued functionx - a candidate solutionSimpleCell