SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem,
UndoableMutationOperator<T> mutation,
Initializer<T> initializer,
ProgressTracker<T> tracker,
SimpleLocalMetaheuristic<T> hc) |
Creates a SimulatedAnnealing search instance for integer-valued optimization problems,
with a default annealing schedule of ModifiedLam , which is the Optimized
Modified Lam of Cicirello (2020), and which
runs a hill climber as a post-processing step.
|
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem,
UndoableMutationOperator<T> mutation,
Initializer<T> initializer,
AnnealingSchedule anneal,
ProgressTracker<T> tracker,
SimpleLocalMetaheuristic<T> hc) |
Creates a SimulatedAnnealing search instance for integer-valued optimization problems
that runs a hill climber as a post-processing step.
|
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem,
UndoableMutationOperator<T> mutation,
Initializer<T> initializer,
AnnealingSchedule anneal,
SimpleLocalMetaheuristic<T> hc) |
Creates a SimulatedAnnealing search instance for integer-valued optimization problems
that runs a hill climber as a post-processing step.
|
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem,
UndoableMutationOperator<T> mutation,
Initializer<T> initializer,
SimpleLocalMetaheuristic<T> hc) |
Creates a SimulatedAnnealing search instance for integer-valued optimization problems,
with a default annealing schedule of ModifiedLam , which is the Optimized
Modified Lam of Cicirello (2020), and which
runs a hill climber as a post-processing step.
|
SimulatedAnnealing(OptimizationProblem<T> problem,
UndoableMutationOperator<T> mutation,
Initializer<T> initializer,
ProgressTracker<T> tracker,
SimpleLocalMetaheuristic<T> hc) |
Creates a SimulatedAnnealing search instance for real-valued optimization problems,
with a default annealing schedule of ModifiedLam , which is the Optimized
Modified Lam of Cicirello (2020), and which
runs a hill climber as a post-processing step.
|
SimulatedAnnealing(OptimizationProblem<T> problem,
UndoableMutationOperator<T> mutation,
Initializer<T> initializer,
AnnealingSchedule anneal,
ProgressTracker<T> tracker,
SimpleLocalMetaheuristic<T> hc) |
Creates a SimulatedAnnealing search instance for real-valued optimization problems
that runs a hill climber as a post-processing step.
|
SimulatedAnnealing(OptimizationProblem<T> problem,
UndoableMutationOperator<T> mutation,
Initializer<T> initializer,
AnnealingSchedule anneal,
SimpleLocalMetaheuristic<T> hc) |
Creates a SimulatedAnnealing search instance for real-valued optimization problems
that runs a hill climber as a post-processing step.
|
SimulatedAnnealing(OptimizationProblem<T> problem,
UndoableMutationOperator<T> mutation,
Initializer<T> initializer,
SimpleLocalMetaheuristic<T> hc) |
Creates a SimulatedAnnealing search instance for real-valued optimization problems,
with a default annealing schedule of ModifiedLam , which is the Optimized
Modified Lam of Cicirello (2020), and which
runs a hill climber as a post-processing step.
|