Uses of Interface
org.cicirello.search.SimpleLocalMetaheuristic

Packages that use SimpleLocalMetaheuristic

Package	Description
org.cicirello.search	This package includes classes and interfaces related to implementing metaheuristic search algorithms in general, rather than specific to a particular metaheuristic.
org.cicirello.search.hc	This package includes classes and interfaces directly related to implementing hill climbers.
org.cicirello.search.sa	This package includes classes and interfaces directly related to implementing simulated annealing.

Uses of SimpleLocalMetaheuristic in org.cicirello.search

Methods in org.cicirello.search that return SimpleLocalMetaheuristic

Modifier and Type	Method	Description
SimpleLocalMetaheuristic<T>	SimpleLocalMetaheuristic.split()

Uses of SimpleLocalMetaheuristic in org.cicirello.search.hc

Classes in org.cicirello.search.hc that implement SimpleLocalMetaheuristic

Modifier and Type	Class	Description
final class	FirstDescentHillClimber<T extends Copyable<T>>	This class implements first descent hill climbing.
final class	SteepestDescentHillClimber<T extends Copyable<T>>	This class implements steepest descent hill climbing.

Uses of SimpleLocalMetaheuristic in org.cicirello.search.sa

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

Modifier	Constructor	Description
	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 SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021), 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 SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021), 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 SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021), 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 SelfTuningLam, which is the Self-Tuning Lam annealing schedule of Cicirello (2021), and which runs a hill climber as a post-processing step.