Package | Description |
---|---|
dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim | |
dev.nm.solver.multivariate.geneticalgorithm.minimizer.deoptim.constrained |
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 |
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 | Method and Description |
---|---|
DEOptimCellFactory |
DEOptim.NewCellFactory.newCellFactory()
Construct a new instance of
DEOptimCellFactory for a minimization problem. |
Constructor and Description |
---|
DEOptimCellFactory(DEOptimCellFactory that)
Copy constructor.
|
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 | Field and Description |
---|---|
protected DEOptimCellFactory |
ConstrainedCellFactory.unconstrainedFactory
a factory that defines the unconstrained Differential Evolution operators
|
Constructor and Description |
---|
ConstrainedCellFactory(DEOptimCellFactory unconstrainedFactory)
Construct an instance of a
ConstrainedCellFactory that define the constrained Differential Evolution operators. |
IntegralConstrainedCellFactory(DEOptimCellFactory factory,
IntegralConstrainedCellFactory.IntegerConstraint constraint)
Construct an instance of
IntegralConstrainedCellFactory . |
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.