Uses of Package
org.cicirello.search

Packages that use org.cicirello.search

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.hc	This package includes classes and interfaces directly related to implementing hill climbers.
org.cicirello.search.operators	This package includes classes and interfaces for defining various operators required by simulated annealing and other metaheuristics, such as mutation operators, along with other related classes and interfaces.
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.

Classes in org.cicirello.search used by org.cicirello.search

Class	Description
Metaheuristic	This interface defines the required methods for implementations of metaheuristics, in particular metaheuristics for which the maximum run length can be specified.
ProgressTracker	This class is used to track search algorithm progress, and supports multithreaded search algorithms.
ReoptimizableMetaheuristic	This interface defines the required methods for implementations of metaheuristics, for which the maximum run length can be specified, and which have the capability of restarting from a previously optimized solution.
SimpleLocalMetaheuristic	This interface defines the required methods for implementations of simple metaheuristics that locally optimize from some initial solution (random or otherwise) whose run length is self-determined, such as hill climbers that terminate upon reaching a local optima.
SimpleMetaheuristic	This interface defines the required methods for implementations of simple metaheuristics whose run length is self-determined, such as hill climbers that terminate upon reaching a local optima.
SolutionCostPair	An object of this class encapsulates a solution with its corresponding cost value.
TrackableSearch	This interface defines the required functionality of search algorithm implementations that support tracking search progress across multiple runs, whether multiple sequential runs, or multiple concurrent runs in the case of a parallel metaheuristic.

Classes in org.cicirello.search used by org.cicirello.search.concurrent

Class	Description
Metaheuristic	This interface defines the required methods for implementations of metaheuristics, in particular metaheuristics for which the maximum run length can be specified.
ProgressTracker	This class is used to track search algorithm progress, and supports multithreaded search algorithms.
ReoptimizableMetaheuristic	This interface defines the required methods for implementations of metaheuristics, for which the maximum run length can be specified, and which have the capability of restarting from a previously optimized solution.
SolutionCostPair	An object of this class encapsulates a solution with its corresponding cost value.
TrackableSearch	This interface defines the required functionality of search algorithm implementations that support tracking search progress across multiple runs, whether multiple sequential runs, or multiple concurrent runs in the case of a parallel metaheuristic.

Classes in org.cicirello.search used by org.cicirello.search.evo

Class	Description
Metaheuristic	This interface defines the required methods for implementations of metaheuristics, in particular metaheuristics for which the maximum run length can be specified.
ProgressTracker	This class is used to track search algorithm progress, and supports multithreaded search algorithms.
ReoptimizableMetaheuristic	This interface defines the required methods for implementations of metaheuristics, for which the maximum run length can be specified, and which have the capability of restarting from a previously optimized solution.
SingleSolutionMetaheuristic	This interface defines the required methods for implementations of single-solution metaheuristics, i.e., metaheuristics such as simulated annealing that operate one a single candidate solution (as compared to population-based metaheuristics such as genetic algorithms.
SolutionCostPair	An object of this class encapsulates a solution with its corresponding cost value.
TrackableSearch	This interface defines the required functionality of search algorithm implementations that support tracking search progress across multiple runs, whether multiple sequential runs, or multiple concurrent runs in the case of a parallel metaheuristic.

Classes in org.cicirello.search used by org.cicirello.search.hc

Class	Description
Metaheuristic	This interface defines the required methods for implementations of metaheuristics, in particular metaheuristics for which the maximum run length can be specified.
ProgressTracker	This class is used to track search algorithm progress, and supports multithreaded search algorithms.
SimpleLocalMetaheuristic	This interface defines the required methods for implementations of simple metaheuristics that locally optimize from some initial solution (random or otherwise) whose run length is self-determined, such as hill climbers that terminate upon reaching a local optima.
SimpleMetaheuristic	This interface defines the required methods for implementations of simple metaheuristics whose run length is self-determined, such as hill climbers that terminate upon reaching a local optima.
TrackableSearch	This interface defines the required functionality of search algorithm implementations that support tracking search progress across multiple runs, whether multiple sequential runs, or multiple concurrent runs in the case of a parallel metaheuristic.

Classes in org.cicirello.search used by org.cicirello.search.operators

Class	Description
SimpleMetaheuristic	This interface defines the required methods for implementations of simple metaheuristics whose run length is self-determined, such as hill climbers that terminate upon reaching a local optima.

Classes in org.cicirello.search used by org.cicirello.search.problems

Class	Description
SolutionCostPair	An object of this class encapsulates a solution with its corresponding cost value.

Classes in org.cicirello.search used by org.cicirello.search.restarts

Class	Description
Metaheuristic	This interface defines the required methods for implementations of metaheuristics, in particular metaheuristics for which the maximum run length can be specified.
ProgressTracker	This class is used to track search algorithm progress, and supports multithreaded search algorithms.
ReoptimizableMetaheuristic	This interface defines the required methods for implementations of metaheuristics, for which the maximum run length can be specified, and which have the capability of restarting from a previously optimized solution.
SolutionCostPair	An object of this class encapsulates a solution with its corresponding cost value.
TrackableSearch	This interface defines the required functionality of search algorithm implementations that support tracking search progress across multiple runs, whether multiple sequential runs, or multiple concurrent runs in the case of a parallel metaheuristic.

Classes in org.cicirello.search used by org.cicirello.search.sa

Class	Description
Metaheuristic	This interface defines the required methods for implementations of metaheuristics, in particular metaheuristics for which the maximum run length can be specified.
ProgressTracker	This class is used to track search algorithm progress, and supports multithreaded search algorithms.
ReoptimizableMetaheuristic	This interface defines the required methods for implementations of metaheuristics, for which the maximum run length can be specified, and which have the capability of restarting from a previously optimized solution.
SimpleLocalMetaheuristic	This interface defines the required methods for implementations of simple metaheuristics that locally optimize from some initial solution (random or otherwise) whose run length is self-determined, such as hill climbers that terminate upon reaching a local optima.
SingleSolutionMetaheuristic	This interface defines the required methods for implementations of single-solution metaheuristics, i.e., metaheuristics such as simulated annealing that operate one a single candidate solution (as compared to population-based metaheuristics such as genetic algorithms.
SolutionCostPair	An object of this class encapsulates a solution with its corresponding cost value.
TrackableSearch	This interface defines the required functionality of search algorithm implementations that support tracking search progress across multiple runs, whether multiple sequential runs, or multiple concurrent runs in the case of a parallel metaheuristic.

Classes in org.cicirello.search used by org.cicirello.search.ss

Class	Description
Metaheuristic	This interface defines the required methods for implementations of metaheuristics, in particular metaheuristics for which the maximum run length can be specified.
ProgressTracker	This class is used to track search algorithm progress, and supports multithreaded search algorithms.
SimpleMetaheuristic	This interface defines the required methods for implementations of simple metaheuristics whose run length is self-determined, such as hill climbers that terminate upon reaching a local optima.
SolutionCostPair	An object of this class encapsulates a solution with its corresponding cost value.
TrackableSearch	This interface defines the required functionality of search algorithm implementations that support tracking search progress across multiple runs, whether multiple sequential runs, or multiple concurrent runs in the case of a parallel metaheuristic.