Uses of Interface
org.cicirello.search.ss.Partial

Packages that use Partial

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

Uses of Partial in org.cicirello.search.problems.scheduling

Methods in org.cicirello.search.problems.scheduling with parameters of type Partial

Modifier and Type	Method	Description
double	ApparentTardinessCost.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	ApparentTardinessCostSetupAdjusted.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	ATCS.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	DynamicATCS.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	EarliestDueDate.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	ExponentialEarlyTardyHeuristic.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	LinearEarlyTardyHeuristic.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	MinimumSlackTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	Montagne.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	ShortestProcessingPlusSetupTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	ShortestProcessingPlusSetupTimePrecompute.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	ShortestProcessingTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	SmallestNormalizedSetup.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	SmallestSetup.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	SmallestSetupPrecompute.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	SmallestTwoJobSetup.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	WeightedCostOverTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	WeightedCostOverTimeSetupAdjusted.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	WeightedCriticalRatio.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	WeightedCriticalRatioSetupAdjusted.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	WeightedLongestProcessingTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	WeightedShortestProcessingPlusSetupTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	WeightedShortestProcessingPlusSetupTimeLateOnly.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	WeightedShortestProcessingPlusSetupTimePrecompute.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	WeightedShortestProcessingTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	WeightedShortestProcessingTimeLateOnly.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)

Uses of Partial in org.cicirello.search.problems.tsp

Methods in org.cicirello.search.problems.tsp that return Partial

Modifier and Type	Method	Description
final Partial<Permutation>	NearestCityHeuristic.createPartial(int n)
final Partial<Permutation>	NearestCityPairHeuristic.createPartial(int n)

Methods in org.cicirello.search.problems.tsp with parameters of type Partial

Modifier and Type	Method	Description
double	NearestCityHeuristic.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)
double	NearestCityPairHeuristic.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval)

Uses of Partial in org.cicirello.search.ss

Classes in org.cicirello.search.ss that implement Partial

Modifier and Type	Class	Description
final class	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.
final class	PartialPermutation	A PartialPermutation represents a permutation that is being iteratively constructed as a solution to an optimization problem over the space of permutations.

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

Modifier and Type	Method	Description
Partial<T>	ConstructiveHeuristic.createPartial(int n)	Creates an empty Partial solution, which will be incrementally transformed into a complete solution of a specified length.
Partial<T>	HybridConstructiveHeuristic.createPartial(int n)

Methods in org.cicirello.search.ss with parameters of type Partial

Modifier and Type	Method	Description
void	IncrementalEvaluation.extend(Partial<T> p, int element)	Extends an incremental evaluation, to account for extending a Partial by the addition of one element.
double	ConstructiveHeuristic.h(Partial<T> p, int element, IncrementalEvaluation<T> incEval)	Heuristically evaluates the possible addition of an element to the end of a Partial.
double	HybridConstructiveHeuristic.h(Partial<T> p, int element, IncrementalEvaluation<T> incEval)