Uses of Interface
org.cicirello.search.sa.AnnealingSchedule

Packages that use AnnealingSchedule

Package	Description
org.cicirello.search.sa	This package includes classes and interfaces directly related to implementing simulated annealing.

Uses of AnnealingSchedule in org.cicirello.search.sa

Classes in org.cicirello.search.sa that implement AnnealingSchedule

Modifier and Type	Class	Description
class	AcceptanceTracker	An AcceptanceTracker can be used to extract fine-grained information about the behavior of an annealing schedule across several runs of simulated annealing.
class	ExponentialCooling	This class implements the classic and most commonly encountered cooling schedule for simulated annealing, the annealing schedule known as exponential cooling (sometimes referred to as geometric cooling).
class	LinearCooling	This class implements the linear cooling schedule for simulated annealing.
class	LogarithmicCooling	This class implements logarithmic cooling, a classic annealing schedule.
class	ModifiedLam	This class implements an optimized variant of the Modified Lam annealing schedule.
class	ModifiedLamOriginal	This class implements the Modified Lam annealing schedule, which dynamically adjusts simulated annealing's temperature parameter up and down to either decrease or increase the neighbor acceptance rate as necessary to attempt to match a theoretically determined ideal.
class	ParameterFreeExponentialCooling	This class implements a parameter-free version of the classic cooling schedule for simulated annealing known as exponential cooling (sometimes referred to as geometric cooling).
class	ParameterFreeLinearCooling	This class implements a parameter-free version of the linear cooling schedule for simulated annealing.

Constructors in org.cicirello.search.sa with parameters of type AnnealingSchedule

Constructor	Description
AcceptanceTracker(AnnealingSchedule schedule)	Constructs the AcceptanceTracker.
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems.
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal, ProgressTracker<T> tracker)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems.
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(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal)	Creates a SimulatedAnnealing search instance for real-valued optimization problems.
SimulatedAnnealing(OptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal, ProgressTracker<T> tracker)	Creates a SimulatedAnnealing search instance for real-valued optimization problems.
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.