|
Drools Planner distribution 6.0.0.Alpha9 | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
Acceptor.DeciderScoreComparatorFactory.EntitySelector.Forager.IncrementalScoreCalculator.MoveSelector.Placer.Score.ScoreDefinition.ScoreDirector.ScoreDirectorFactory.ScoreHolder.Selector.Termination.ValueSelector.Decider.ProblemFactChange to be processed.
Score is calculated for the current workingSolution
in the current ScoreDirector (with possibly incremental calculation residue),
it is equal to the parameter expectedWorkingScore.
Score is calculated for the parameter solution,
it would be equal to the Solution.getScore() of that parameter.
Score is calculated for the current workingSolution
in a fresh ScoreDirector (with no incremental calculation residue),
it is equal to the parameter workingScore.
Score is based on n levels of int constraints.Solution is found.
Solver encounters.BruteForceSolverPhase is a SolverPhase which uses the brute force algorithm.ScoreDirector instance.
ScoreHolder is dead
Solver instance.
Iterator does not shuffle and is never ending.EntitySelector that caches the result of its child EntitySelector.MoveSelector that caches the result of its child MoveSelector.ValueSelector that caches the result of its child ValueSelector.Termination.calculateSolverTimeGradient(DefaultSolverScope).
Score and updates the workingSolution accordingly.
Termination.calculateSolverTimeGradient(DefaultSolverScope).
CompositeMoveSelector that cartesian products 2 or more MoveSelectors.ScoreDirector and its workingSolution.
MoveSelector.ConstructionHeuristicSolverPhase is a SolverPhase which uses a construction heuristic algorithm,
such as first fit, best fit decreasing, cheapest insertion, ...SelectionCacheType.
SelectionCacheType.
SelectionCacheType.
Solver.
CustomSolverPhase is a SolverPhase which uses the brute force algorithmBruteForceSolverPhase.ConstructionHeuristicSolverPhase.CustomSolverPhase.Decider.GreedyFitSolverPhase.LocalSearchSolverPhase.Solver configurations on multiple problem instances (data sets).Solver.SubChainSelector implementation.Solution of the ScoreDirector
and notifies the ScoreDirector accordingly.
Solution and its ScoreDirector accordingly.
ScoreDirector, which directs the Rule Engine to calculate the Score
of the Solution workingSolution.ScoreDirectorFactory.QueuedEntityPlacerConfig // TODO and PooledEntityPlacerConfig.PlanningEntity annotated class.Score, calculated by the WorkingMemory for DroolsScoreDirector.
Score that supports FeasibilityScore.isFeasible().EntitySelector's are upgraded to SelectionCacheType.STEP.HardSoftScores based on the calculation of the hard multiplied by a weight, summed with the soft.String representation of the Score.
ValueSelector implementation.EntitySelector implementation.ValueSelector implementation.MoveSelector.SelectionCacheType.JUST_IN_TIME,
even if a selector child caches.
Solution type potentially has its own file extension.
MoveSelectors
s(uch as ChangeMoveSelector and SwapMoveSelector) already handle 1-sized chains.
Score is the Score of which there is no better in any problem instance.
Score is the Score of which there is no worse in any problem instance.
DroolsScoreDirector when the Solution needs to be inserted
into an empty WorkingMemory.
Class of the actual Score implementation
Selector with Selector.isNeverEnding() true should return a size
as if it would be able to return each distinct element only once,
because the size can be used in SelectionProbabilityWeightFactory.
IterableSelector.getSize(), but requires an entity.
SolverConfig at runtime before building the Solver.
GreedyFitStepScope.isBestSolutionCloningDelayed() return true
ConstructionHeuristicStepScope.isBestSolutionCloningDelayed() return true
Solution that is used to calculate the Score.
SolverPhase which uses the greedy algorithm, which is a construction heuristic.Score is based on 3 levels of int constraints: hard, medium and soft.Score is based on 2 levels of BigDecimal constraints: hard and soft.Score is based on 2 levels of double constraints: hard and soft.Score is based on 2 levels of long constraints: hard and soft.Score is based on 2 levels of int constraints: hard and soft.Iterator.hasNext().
Score calculation.ScoreDirector, which only recalculates the Score
of the part of the Solution workingSolution that changed,
instead of the going through the entire Solution.ScoreDirectorFactory.Selector.isNeverEnding() is also true.
ProblemFactChanges have been processed.
Solution is feasible if it has no broken hard constraints.
Solution is feasible if it has no broken hard constraints.
PlanningVariable.nullable() value is always considered initialized, but it can still be reinitialized
with PlanningVariable.reinitializeVariableEntityFilter().
Selector.isContinuous() is true
or if this selector is in random order (for most cases).
SolverPhase after every step and every move to determine if the search should stop.
Solver after every phase to determine if the search should stop.
Iterable.iterator(), but requires an entity.
SimulatedAnnealingAcceptor is always better.Iterable interface that supports ListIterable.listIterator() and ListIterable.listIterator(int).List.listIterator()
List.listIterator()
LocalSearchSolverPhase is a SolverPhase which uses a local search algorithm,
such as tabu search, simulated annealing, ...Solution.Iterator of custom Moves.MoveIteratorFactory to a MoveSelector.List of custom Moves.MoveListFactory to a MoveSelector.Moves.ChangeMoveSelectorConfig, etc.DeciderScoreComparatorFactory.Iterator.next().
Random.nextInt(int) for doubles.
Random.nextInt(int) for longs.
String and returns a Score.
List of entities that are somehow related.ValuePlacer
which fits 1 entity or value.EntityPlacerConfig and ValuePlacerConfig.Examination.examList.
Solution that implements its own planning cloning
instead of letting the default or a custom SolutionCloner do it.Solution is a collection of planning entities.Solution is a planning entity.Solver configurations.Solution.Solution from or to a File.ProblemBenchmarkPropertyDescriptor for faster and easier access.PillarSelector implementation.Scores and what the perfect maximum/minimum Score is.workingSolution
and calculates the Score for that Solution.ScoreDirector.Score.PlanningEntity, a planningValue, a Move or a Selector).PlanningEntity, a planningValue, a Move or a Selector).List of selection
(which is a PlanningEntity, a planningValue, a Move or a Selector).PlanningEntity, a planningValue, a Move or a Selector).MoveSelector, EntitySelector and ValueSelector
which generates Moves or parts of them.MoveSelectorConfig, EntitySelectorConfig and ValueSelectorConfig.Solver when the Score of this Solution has been calculated.
workingSolution must never be the same instance as the bestSolution,
it should be a (un)changed clone.
Score is based on 1 level of BigDecimal constraints.Score is based on 1 level of double constraints.Score is based on 1 level of long constraints.Score is based on 1 level of int constraints.Score calculation.ScoreDirector, which recalculates the Score
of the Solution workingSolution every time.ScoreDirectorFactory.Solver configuration for 1 problem instance (data set).SingleBenchmarkSolution during planning.Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used
because the rule engine already requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used
because the rule engine already requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Object.equals(Object) and Object.hashCode() cannot be used because the rule engine already
requires them (for performance in their original state).
Solver configuration benchmarked on multiple problem instances (data sets).Solver.Solver or a SolverPhase should stop.SolverBenchmarkRankingWeightFactory orders a SolverBenchmark by how how many time each of it's
SingleBenchmark beat the SingleBenchmark of the other SolverBenchmarks.Comparator orders a SolverBenchmark by its total Score.CompositeMoveSelector that unions 2 or more MoveSelectors.FieldAccessingSolutionCloner.FieldAccessingSolutionClonerRun.isFieldAnEntityPropertyOnSolution(java.lang.reflect.Field) assumptions were wrong.
BendableScore.
ValueRange.Comparator orders a SolverBenchmark by its worst Score.Solver.
|
Drools Planner distribution 6.0.0.Alpha9 | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||