Package org.cicirello.search.ss
This package includes classes and interfaces directly related to implementing
stochastic sampling algorithms.

Interface Summary Interface Description ConstructiveHeuristic<T extends Copyable<T>> Classes implementing this interface are used as constructive heuristics for constructing heuristic solutions to optimization problems, as well as for certain stochastic sampling search algorithms.HeuristicBiasedStochasticSampling.BiasFunction Implement this interface to implement the bias function used by HBSS.IncrementalEvaluation<T extends Copyable<T>> The implementations of constructive heuristics and stochastic samplers biased by constructive heuristics in the library support incremental updates, as the solution is heuristically assembled, to problem and/or heuristic data utilized by the heuristic.Partial<T extends Copyable<T>> A Partial represents a partial solution to a problem (e.g., a partial permutation or a partial integer vector) that is being iteratively constructed as a solution to an optimization problem.ValueBiasedStochasticSampling.BiasFunction Implement this interface to implement the bias function used by VBSS. 
Class Summary Class Description AcceptanceBandSampling<T extends Copyable<T>> The AcceptanceBandSampling class implements a form of stochastic sampling search that uses a constructive heuristic to guide the random decisions.HeuristicBiasedStochasticSampling<T extends Copyable<T>> Heuristic Biased Stochastic Sampling (HBSS) is a form of stochastic sampling search that uses a constructive heuristic to bias the random decisions.HeuristicPermutationGenerator This class generates solutions to permutation optimization problems using a constructive heuristic.HeuristicSolutionGenerator<T extends Copyable<T>> This class generates solutions to optimization problems using a constructive heuristic.HybridConstructiveHeuristic<T extends Copyable<T>> A HybridConstructiveHeuristic maintains a list ofConstructiveHeuristic
objects for a problem, for use in a multiheuristic stochastic sampling search, where each full iteration of the stochastic sampler uses a single heuristic for all decisions, but where a different heuristic is chosen for each iteration.IterativeSampling<T extends Copyable<T>> Iterative sampling is the simplest possible form of a stochastic sampling search.PartialIntegerVector A PartialIntegerVector represents a vector of integers that is being iteratively constructed as a solution to an optimization problem over the space of integer vectors.PartialPermutation A PartialPermutation represents a permutation that is being iteratively constructed as a solution to an optimization problem over the space of permutations.ValueBiasedStochasticSampling<T extends Copyable<T>> Value Biased Stochastic Sampling (VBSS) is a form of stochastic sampling search that uses a constructive heuristic to bias the random decisions.