Uses of Interface
org.cicirello.search.ss.IncrementalEvaluation
Packages that use IncrementalEvaluation
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 IncrementalEvaluation in org.cicirello.search.problems.scheduling
Methods in org.cicirello.search.problems.scheduling that return IncrementalEvaluationModifier and TypeMethodDescriptionApparentTardinessCost.createIncrementalEvaluation()ApparentTardinessCostSetupAdjusted.createIncrementalEvaluation()ATCS.createIncrementalEvaluation()DynamicATCS.createIncrementalEvaluation()ExponentialEarlyTardyHeuristic.createIncrementalEvaluation()LinearEarlyTardyHeuristic.createIncrementalEvaluation()Montagne.createIncrementalEvaluation()WeightedCostOverTime.createIncrementalEvaluation()WeightedCostOverTimeSetupAdjusted.createIncrementalEvaluation()WeightedCriticalRatio.createIncrementalEvaluation()WeightedCriticalRatioSetupAdjusted.createIncrementalEvaluation()WeightedShortestProcessingPlusSetupTimeLateOnly.createIncrementalEvaluation()WeightedShortestProcessingTimeLateOnly.createIncrementalEvaluation()Methods in org.cicirello.search.problems.scheduling with parameters of type IncrementalEvaluationModifier and TypeMethodDescriptiondoubleApparentTardinessCost.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleApparentTardinessCostSetupAdjusted.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleATCS.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleDynamicATCS.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleEarliestDueDate.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleExponentialEarlyTardyHeuristic.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleLinearEarlyTardyHeuristic.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleMinimumSlackTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleMontagne.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleShortestProcessingPlusSetupTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleShortestProcessingPlusSetupTimePrecompute.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleShortestProcessingTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleSmallestNormalizedSetup.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleSmallestSetup.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleSmallestSetupPrecompute.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleSmallestTwoJobSetup.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleWeightedCostOverTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleWeightedCostOverTimeSetupAdjusted.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleWeightedCriticalRatio.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleWeightedCriticalRatioSetupAdjusted.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleWeightedLongestProcessingTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleWeightedShortestProcessingPlusSetupTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleWeightedShortestProcessingPlusSetupTimeLateOnly.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleWeightedShortestProcessingPlusSetupTimePrecompute.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleWeightedShortestProcessingTime.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleWeightedShortestProcessingTimeLateOnly.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) -
Uses of IncrementalEvaluation in org.cicirello.search.problems.tsp
Methods in org.cicirello.search.problems.tsp that return IncrementalEvaluationMethods in org.cicirello.search.problems.tsp with parameters of type IncrementalEvaluationModifier and TypeMethodDescriptiondoubleNearestCityHeuristic.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) doubleNearestCityPairHeuristic.h(Partial<Permutation> p, int element, IncrementalEvaluation<Permutation> incEval) -
Uses of IncrementalEvaluation in org.cicirello.search.ss
Methods in org.cicirello.search.ss that return IncrementalEvaluationModifier and TypeMethodDescriptiondefault IncrementalEvaluation<T>ConstructiveHeuristic.createIncrementalEvaluation()Creates an IncrementalEvaluation object corresponding to an initially empty Partial for use in incrementally constructing a solution to the problem for which this heuristic is designed.HybridConstructiveHeuristic.createIncrementalEvaluation()This method handles choosing the heuristic for the next iteration of the stochastic sampling search, and then delegates the usual function of this method to the chosen heuristic.Methods in org.cicirello.search.ss with parameters of type IncrementalEvaluationModifier and TypeMethodDescriptiondoubleConstructiveHeuristic.h(Partial<T> p, int element, IncrementalEvaluation<T> incEval) Heuristically evaluates the possible addition of an element to the end of a Partial.doubleHybridConstructiveHeuristic.h(Partial<T> p, int element, IncrementalEvaluation<T> incEval)