Modifier and Type | Class and Description |
---|---|
class |
Best1Bin
The Best-1-Bin rule is the same as the Rand-1-Bin rule,
except that it always pick the best candidate in the population to be the base.
|
class |
Best2Bin
The Best-1-Bin rule always picks the best chromosome as the base.
|
class |
DEOptimCellFactory
A
DEOptimCellFactory produces DEOptimCellFactory.DeOptimCells. |
class |
Rand1Bin
The Rand-1-Bin rule is defined by:
mutation by adding a scaled, randomly sampled vector difference to a third vector
(differential mutation);
crossover by performing a uniform crossover (discrete recombination).
|
Modifier and Type | Class and Description |
---|---|
class |
ConstrainedCellFactory
This defines a Differential Evolution operator that takes in account constraints.
|
class |
IntegralConstrainedCellFactory
This implementation defines the constrained Differential Evolution operators that solve an Integer Programming problem.
|
Modifier and Type | Class and Description |
---|---|
class |
LocalSearchCellFactory<P extends OptimProblem,T extends IterativeMinimizer<OptimProblem>>
|
Modifier and Type | Field and Description |
---|---|
protected SimpleCellFactory |
SimpleGridMinimizer.Solution.factory |
Modifier and Type | Method and Description |
---|---|
SimpleCellFactory |
SimpleGridMinimizer.NewCellFactoryCtor.newCellFactory()
Construct a new instance of
SimpleCellFactory for a minimization problem. |
Constructor and Description |
---|
PerturbationAroundPoint(RealScalarFunction f,
SimpleCellFactory factory,
int poolSize,
Vector var,
Vector initial0,
long seed)
Generate an initial pool of chromosomes by adding a variance around a given initial.
|
UniformMeshOverRegion(RealScalarFunction f,
SimpleCellFactory factory,
RandomLongGenerator uniform,
int minDiscretization,
Vector[] initials0,
double epsilon)
Generate an initial pool of chromosomes by putting a uniform mesh/grid/net over the entire
region.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.