Uses of Interface
org.cicirello.search.ss.ConstructiveHeuristic
Package
Description
Package of classes and interfaces related to representing
and solving scheduling problems, which includes implementations
of constructive heuristics for scheduling problems.
Classes and interfaces related to the Traveling Salesperson Problem (TSP).
This package includes classes and interfaces directly related to implementing
stochastic sampling algorithms.

Uses of ConstructiveHeuristic in org.cicirello.search.problems.scheduling
Modifier and TypeClassDescriptionfinal class
This is an implementation of the Apparent Tardiness Cost (ATC) heuristic.final class
This is an implementation of a variation of the Apparent Tardiness Cost (ATC) heuristic, with a simple adjustment for setup times for problems with sequencedependent setups.final class
This is an implementation of the ATCS (Apparent Tardiness Cost with Setups) heuristic.final class
DynamicATCS is an implementation of a variation of the ATCS (Apparent Tardiness Cost with Setups) heuristic, which dynamically updates the average processing and setup times as it constructs the schedule.final class
This is an implementation of the earliest due date heuristic.final class
This class implements a constructive heuristic, known as EXPET, for scheduling problems involving minimizing the sum of weighted earliness plus weighted tardiness.final class
This class implements a constructive heuristic, known as LINET, for scheduling problems involving minimizing the sum of weighted earliness plus weighted tardiness.final class
This is an implementation of the minimum slack time (MST) heuristic.final class
This is an implementation of Montagne's heuristic heuristic.final class
This is an implementation of the shortest process time heuristic, adjusted to include setup time.final class
This is an implementation of the shortest process time heuristic, adjusted to include setup time.final class
This is an implementation of the shortest process time heuristic.final class
This heuristic is smallest normalized setup.final class
This heuristic is the smallest setup first.final class
This heuristic is the smallest setup first.final class
This heuristic is smallest twojob setup.final class
This is an implementation of the weighted COVERT heuristic.final class
This is an implementation of a variation of the weighted COVERT heuristic, adjusted to account for setup times for problems with sequencedependent setups.final class
This is an implementation of a variation of the weighted critical ratio heuristic.final class
This is an implementation of a variation of the weighted critical ratio heuristic, adjusted to account for setup times for problems with sequencedependent setups.final class
This is an implementation of the weighted longest process time heuristic.class
This class implements a variation the weighted shortest process time heuristic, but adjusted to incorporate setups times for problems with sequencedependent setups.final class
This class implements a variation the weighted shortest process time heuristic with nonzero heuristic values only for late jobs, but adjusted to incorporate setups times for problems with sequencedependent setups.class
This class implements a variation the weighted shortest process time heuristic, but adjusted to incorporate setups times for problems with sequencedependent setups.class
This is an implementation of the weighted shortest process time heuristic.final class
This is an implementation of the weighted shortest process time heuristic. 
Uses of ConstructiveHeuristic in org.cicirello.search.problems.tsp
Modifier and TypeClassDescriptionfinal class
This class implements a nearest city constructive heuristic for the TSP for use by stochastic sampling algorithms.final class
This class implements a constructive heuristic for the TSP that prefers the first city of the nearest pair of cities. 
Uses of ConstructiveHeuristic in org.cicirello.search.ss
Modifier and TypeClassDescriptionfinal class
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.ModifierConstructorDescriptionAcceptanceBandSampling
(ConstructiveHeuristic<T> heuristic) Constructs an AcceptanceBandSampling search object.AcceptanceBandSampling
(ConstructiveHeuristic<T> heuristic, double beta) Constructs an AcceptanceBandSampling search object.AcceptanceBandSampling
(ConstructiveHeuristic<T> heuristic, double beta, ProgressTracker<T> tracker) Constructs an AcceptanceBandSampling search object.AcceptanceBandSampling
(ConstructiveHeuristic<T> heuristic, ProgressTracker<T> tracker) Constructs an AcceptanceBandSampling search object.HeuristicBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic) Constructs a HeuristicBiasedStochasticSampling search object.HeuristicBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, boolean exponentialBias) Constructs a HeuristicBiasedStochasticSampling search object.HeuristicBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, boolean exponentialBias, ProgressTracker<T> tracker) Constructs a HeuristicBiasedStochasticSampling search object.HeuristicBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, double exponent) Constructs a HeuristicBiasedStochasticSampling search object.HeuristicBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, double exponent, ProgressTracker<T> tracker) Constructs a HeuristicBiasedStochasticSampling search object.HeuristicBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, ProgressTracker<T> tracker) Constructs a HeuristicBiasedStochasticSampling search object.HeuristicBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, HeuristicBiasedStochasticSampling.BiasFunction bias) Constructs a HeuristicBiasedStochasticSampling search object.HeuristicBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, HeuristicBiasedStochasticSampling.BiasFunction bias, ProgressTracker<T> tracker) Constructs a HeuristicBiasedStochasticSampling search object.Constructs an HeuristicPermutationGenerator for generating solutions to an optimization problem using a constructive heuristic.HeuristicPermutationGenerator
(ConstructiveHeuristic<Permutation> heuristic, ProgressTracker<Permutation> tracker) Constructs an HeuristicPermutationGenerator for generating solutions to an optimization problem using a constructive heuristic.HeuristicSolutionGenerator
(ConstructiveHeuristic<T> heuristic) Constructs an HeuristicSolutionGenerator for generating solutions to an optimization problem using a constructive heuristic.HeuristicSolutionGenerator
(ConstructiveHeuristic<T> heuristic, ProgressTracker<T> tracker) Constructs an HeuristicSolutionGenerator for generating solutions to an optimization problem using a constructive heuristic.ValueBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic) Constructs a ValueBiasedStochasticSampling search object.ValueBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, double exponent) Constructs a ValueBiasedStochasticSampling search object.ValueBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, double exponent, ProgressTracker<T> tracker) Constructs a ValueBiasedStochasticSampling search object.ValueBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, ProgressTracker<T> tracker) Constructs a ValueBiasedStochasticSampling search object.ValueBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, ValueBiasedStochasticSampling.BiasFunction bias) Constructs a ValueBiasedStochasticSampling search object.ValueBiasedStochasticSampling
(ConstructiveHeuristic<T> heuristic, ValueBiasedStochasticSampling.BiasFunction bias, ProgressTracker<T> tracker) Constructs a ValueBiasedStochasticSampling search object.ModifierConstructorDescriptionHybridConstructiveHeuristic
(List<? extends ConstructiveHeuristic<T>> heuristics) Constructs the HybridConstructiveHeuristic, where the heuristic is chosen uniformly at random at the start of each iteration of the stochastic sampler (i.e., each timeHybridConstructiveHeuristic.createIncrementalEvaluation()
is called).HybridConstructiveHeuristic
(List<? extends ConstructiveHeuristic<T>> heuristics, boolean roundRobin) Constructs the HybridConstructiveHeuristic, where the heuristic is either chosen uniformly at random at the start of each iteration of the stochastic sampler (i.e., each timeHybridConstructiveHeuristic.createIncrementalEvaluation()
is called), or using the round robin strategy.HybridConstructiveHeuristic
(List<? extends ConstructiveHeuristic<T>> heuristics, int[] weights) Constructs the HybridConstructiveHeuristic, where the heuristic is chosen using a weighted random decision at the start of each iteration of the stochastic sampler (i.e., each timeHybridConstructiveHeuristic.createIncrementalEvaluation()
is called).