This heuristic is the smallest setup first. We define it as: h(j) = 1 / (1 + s[i][j]), where s[i][j] is the setup time of job j if it follows job i on the machine.
The heuristic values are computed each time the
h(org.cicirello.search.ss.Partial<org.cicirello.permutations.Permutation>, int, org.cicirello.search.ss.IncrementalEvaluation<org.cicirello.permutations.Permutation>) method is called. Therefore, for a many
iterations of stochastic sampling, the same
heuristic values may be computed repeatedly. If your
problem instance is small enough to be able to afford
the extra memory, you might consider instead using
SmallestSetupPrecompute class, which
implements the same heuristic, but it precomputes
a table of heuristic values upon constructing the
Field SummaryModifier and TypeFieldDescription
static final doubleThe minimum heuristic value.
Method SummaryModifier and TypeMethodDescription
final intGets the required length of complete solutions to the problem instance for which this constructive heuristic is configured.
(int n)Creates an empty Partial solution, which will be incrementally transformed into a complete solution of a specified length.Gets a reference to the instance of the optimization problem that is the subject of this heuristic.
doubleHeuristically evaluates the possible addition of an element to the end of a Partial.
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
MIN_Hpublic static final double MIN_HThe minimum heuristic value. If the heuristic value as calculated is lower than MIN_H, then MIN_H is used as the heuristic value. The reason is related to the primary purpose of the constructive heuristics in the library: heuristic guidance for stochastic sampling algorithms, which assume positive heuristic values (e.g., an h of 0 would be problematic).
- See Also:
(SingleMachineSchedulingProblem problem)Constructs an SmallestSetup heuristic.
problem- The instance of a scheduling problem that is the target of the heuristic.
hHeuristically evaluates the possible addition of an element to the end of a Partial. Higher evaluations imply that the element is a better choice for the next element to add. For example, if you evaluate two elements, x and y, with h, and h returns a higher value for y than for x, then this means that y is believed to be the better choice according to the heuristic. Implementations of this interface must ensure that h always returns a positive result. This is because stochastic sampling algorithms such as HBSS and VBSS assume that the constructive heuristic returns only positive values.
p- The current state of the Partial
element- The element under consideration for adding to the Partial
incEval- An IncrementalEvaluation of p. This method assumes that incEval is of the same runtime type as the object returned by
- The heuristic evaluation of the hypothetical addition of element to the end of p. The higher the evaluation, the more important the heuristic believes that element should be added next. The intention is to compare the value returned with the heuristic evaluations of other elements. Individual results in isolation are not necessarily meaningful.
getProblemGets a reference to the instance of the optimization problem that is the subject of this heuristic.
createPartialCreates an empty Partial solution, which will be incrementally transformed into a complete solution of a specified length.
completeLengthpublic final int completeLength()Gets the required length of complete solutions to the problem instance for which this constructive heuristic is configured.