Uses of Class
org.cicirello.search.SolutionCostPair

Packages that use SolutionCostPair

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.concurrent	This package includes multithreaded search implementations, as well as classes and interfaces related to implementing multithreaded metaheuristics.
org.cicirello.search.evo	This package includes classes and interfaces directly related to implementing evolutionary algorithms.
org.cicirello.search.problems	Package of classes and interfaces related to representing computational problems, as well as classes implementing a variety of specific computational problems.
org.cicirello.search.restarts	This package includes classes and interfaces related to implementing multistart metaheuristics (i.e., metaheuristics that periodically restart, and return the best solution across a number of such restarts).
org.cicirello.search.sa	This package includes classes and interfaces directly related to implementing simulated annealing.
org.cicirello.search.ss	This package includes classes and interfaces directly related to implementing stochastic sampling algorithms.

Uses of SolutionCostPair in org.cicirello.search

Methods in org.cicirello.search that return SolutionCostPair

Modifier and Type	Method	Description
SolutionCostPair<T>	ProgressTracker.getSolutionCostPair()	Gets the current best solution and its corresponding cost from the ProgressTracker.
SolutionCostPair<T>	Metaheuristic.optimize(int runLength)	Executes a run of the metaheuristic beginning at a randomly generated solution.
SolutionCostPair<T>	SimpleLocalMetaheuristic.optimize(T start)	Executes a single run of a metaheuristic, whose run length cannot be specified (e.g., a hill climber that terminates when it reaches a local optima), beginning at a specified solution.
SolutionCostPair<T>	SimpleMetaheuristic.optimize()	Executes a single run of a metaheuristic whose run length cannot be specified (e.g., a hill climber that terminates when it reaches a local optima, or a stochastic sampler that terminates when it constructs one solution, etc).
SolutionCostPair<T>	SingleSolutionMetaheuristic.optimize(int runLength, T start)	Executes a run of the metaheuristic beginning at a specified starting solution.
SolutionCostPair<T>	ReoptimizableMetaheuristic.reoptimize(int runLength)	Executes a run of the metaheuristic beginning at the previously best found solution rather than from a random one.

Methods in org.cicirello.search with parameters of type SolutionCostPair

Modifier and Type	Method	Description
int	SolutionCostPair.compareTo(SolutionCostPair<T> other)	Compares this SolutionCostPair with the specified SolutionCostPair for order.
boolean	ProgressTracker.update(SolutionCostPair<T> pair)	Updates the best solution contained in this progress tracker.

Uses of SolutionCostPair in org.cicirello.search.concurrent

Methods in org.cicirello.search.concurrent that return SolutionCostPair

Modifier and Type	Method	Description
final SolutionCostPair<T>	ParallelMetaheuristic.optimize(int runLength)	Executes a parallel metaheuristic search.
final SolutionCostPair<T>	TimedParallelMultistarter.optimize(int time)	Executes a parallel multistart search.
final SolutionCostPair<T>	ParallelReoptimizableMetaheuristic.reoptimize(int runLength)	Executes a parallel metaheuristic search.
SolutionCostPair<T>	TimedParallelReoptimizableMultistarter.reoptimize(int time)	Executes a parallel multistart search.

Methods in org.cicirello.search.concurrent that return types with arguments of type SolutionCostPair

Modifier and Type	Method	Description
final ArrayList<SolutionCostPair<T>>	TimedParallelMultistarter.getSearchHistory()	Gets a list of the best solution stored in this search's ProgressTracker at each time interval of the most recent call to the TimedParallelMultistarter.optimize(int) method, or null if TimedParallelMultistarter.optimize(int) has not been called.

Uses of SolutionCostPair in org.cicirello.search.evo

Methods in org.cicirello.search.evo that return SolutionCostPair

Modifier and Type	Method	Description
final SolutionCostPair<T>	OnePlusOneEvolutionaryAlgorithm.optimize(int maxEvals)	Runs the EA beginning at a random initial solution.
final SolutionCostPair<T>	OnePlusOneEvolutionaryAlgorithm.optimize(int maxEvals, T start)	Runs the EA beginning at a specified initial solution.
final SolutionCostPair<T>	OnePlusOneEvolutionaryAlgorithm.reoptimize(int maxEvals)	Continues optimizing starting from the previous best found solution contained in the tracker object, rather than from a random one.

Uses of SolutionCostPair in org.cicirello.search.problems

Methods in org.cicirello.search.problems that return SolutionCostPair

Modifier and Type	Method	Description
default SolutionCostPair<T>	IntegerCostOptimizationProblem.getSolutionCostPair(T candidate)	Computes the cost of a candidate solution to the problem instance.
default SolutionCostPair<T>	OptimizationProblem.getSolutionCostPair(T candidate)	Computes the cost of a candidate solution to the problem instance.
SolutionCostPair<T>	Problem.getSolutionCostPair(T candidate)	Computes the cost of a candidate solution to the problem instance.

Uses of SolutionCostPair in org.cicirello.search.restarts

Methods in org.cicirello.search.restarts that return SolutionCostPair

Modifier and Type	Method	Description
final SolutionCostPair<T>	Multistarter.optimize(int numRestarts)	Executes a multistart search, calling the underlying metaheuristic the specified number of times, keeping track of the best solution across the multiple runs of the search.
SolutionCostPair<T>	ReoptimizableMultistarter.reoptimize(int numRestarts)	Executes a multistart search, calling the underlying metaheuristic the specified number of times, keeping track of the best solution across the multiple runs of the search.

Uses of SolutionCostPair in org.cicirello.search.sa

Methods in org.cicirello.search.sa that return SolutionCostPair

Modifier and Type	Method	Description
final SolutionCostPair<T>	SimulatedAnnealing.optimize(int maxEvals)	Executes a run of simulated annealing beginning at a randomly generated solution.
final SolutionCostPair<T>	SimulatedAnnealing.optimize(int maxEvals, T start)	Executes a run of simulated annealing beginning at a specified starting solution.
final SolutionCostPair<T>	SimulatedAnnealing.reoptimize(int maxEvals)	Reaneals starting from the previous best found solution contained in the tracker object.

Uses of SolutionCostPair in org.cicirello.search.ss

Methods in org.cicirello.search.ss that return SolutionCostPair

Modifier and Type	Method	Description
final SolutionCostPair<T>	HeuristicSolutionGenerator.optimize()